搜索资源列表
js二叉树和链表
- javascr ipt语言的二叉树和链表写法,觉得有用的拿去(javascr ipt binary tree and chain table.)
AVL树
- 二叉树的ADT、搜索树的ADT、平衡二叉树的ADT。AVL树包含了AVL的建立、查找、删除操作。全部使用类模板,方便调用(ADT for binary tree, ADT for search tree, ADT for balanced binary tree. AVL tree contains the establishment of AVL, find, delete operation. All use of class templates, easy to call)
二叉树
- 利用java实现二叉树的三种遍历方式,包括先序、中序、后序。(Three traversing ways of two forked trees are realized by using Java.)
二叉树
- 实现了二叉树的创建,先序遍历,中序遍历,后序遍历以及二叉树的竖式打印(binary tree traverse)
树型框操作
- 树型框全操作,适合新手学习,如果在学习易语言树型框可以参考一下(Tree box full operation, suitable for novice learning, if the learning of the easy language tree box can refer to)
赫夫曼树
- 数据结构赫夫曼树!!!!!希望大家有所采纳!!!!!!!!!!!!(fewgtwergjwerjgkjwekjghkweujktrhjg)
03平衡二叉树_AVLTree
- 查找算法,平衡二叉树,大话数据结构里面的。(Lookup algorithm, balance two forked tree, big talk data structure inside.)
决策树
- 数据处理中经常使用决策树算法,在MATLAB中编辑决策树算法(Decision tree algorithm is often used in data processing, and the decision tree algorithm is edited in MATLAB)
个人的树型结构程序例(一张表的)
- 个人的树型结构程序例(一张表的),是一个小小的树型结构的例子(An example of a personal tree structure program (a table) is an example of a small tree structure.)
ID3决策树
- Java实现用ID3算法构建决策树(Java implementation using ID3 algorithm to build decision tree)
图、树函数大全
- 常用的图和树的函数大全,函数可以复制,但是程序本身可能不能编译通过。(The common graph and the function of the tree, the function can be copied, but the program itself may not be compiled and passed.)
最好的树状界面实例explorestruct
- 在GUI界面上写了一个树状菜单,实现点击不同的节点实现不同的事件(A tree - like menu is written on the GUI interface to implement different events by clicking on different nodes)
决策树java代码1
- 决策树可对数据进行分类,选出最大增益属性。(Decision tree can be classified data, select the maximum gain attribute.)
二叉树的四种遍历方式与层序创建
- 本例程实现对于二叉树的四种遍历方式,先序,中序,后序,层序四种遍历(This routine implements four traversing methods for two forked trees, the first order, the middle order, the rear order and the sequence of four ergodicity.)
决策树与随机森林
- 给出对决策树与随机森林的认识。主要分析决策树的学习算法:信息增益和ID3、C4.5、CART树,然后给出随机森林。 决策树中,最重要的问题有3个: 1. 特征选择。即选择哪个特征作为某个节点的分类特征; 2. 特征值的选择。即选择好特征后怎么划分子树; 3. 决策树出现过拟合怎么办? 下面分别就以上问题对决策树给出解释。决策树往往是递归的选择最优特征,并根据该特征对训练数据进行分割。(The understanding of decision tree and random
二叉树基本操作的程序实现
- 数据结构二叉树的基本操作,比较基础,初学者专用吧。。。(The basic operation of a binary tree)
二叉排序树
- 数据结构,关于二叉排序树,实现其建立,排序,查找等功能(Data structure, about the two fork sort tree, to build, sort, find and other functions)
二叉树
- 建立二叉树,用四种方法遍历,求二叉树的树高及结点总权,并且能输入一个结点求其父结点(The two forked tree is required to be traversed by four methods, and the height of the two forked tree and the total weight of the node are calculated, and a node can be entered to find the parent node of the
08 决策树与随机森林
- 决策树和决策森林的代码,很不错,适合初学者,一起交流一起进步(The decision tree and decision forest code, very good, suitable for beginners, together with the progress of communication)
8606-二叉树的构建及遍历操作
- 实现二叉树的遍历操作,属于数据结构基础算法,代码能够顺利运行,运行环境是ColdBlick。(The traversing operation of two forked tree belongs to the basic algorithm of data structure, the code can run smoothly, and the running environment is ColdBlick.)