搜索资源列表
phptree
- PHP+HTML开发,树型结构自动生成HTML文件-PHP HTML development, tree structure automatically generate HTML documents
SimpleBinaryTreeExample
- 一个简单二叉树类（非本人原创）-a simple binary tree type (I originality)
c45_vc
- 计算机人工智能方面的决策树方法 c4.5-the decision tree method Bank
xtree117
- 很好的关于树的例子，很不错。用javascr ipt实现-good exsample about tree,great.implement in javascr ipt.
c-algorithm-set
- c语言的经典算法源代码！其中包含数据结构中很多重要的算法，还有链表＆树等多种常用算法的应用-classical algorithm source code! Data structure which contains many important algorithms, Chain & trees and other commonly used algorithm application
用C++描述的各种数据结构算法
- 包含几十个有关数据结构算法的源代码 包括栈 队列 树图等 是初学者的最佳选择-contains dozens of the data structure of the algorithm source code stacks include Queue tree map is the best choice for beginners
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
二叉树jian
- 这个程序采用先序建立二叉树，并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出，并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non - recursive algorithm of this binary tree after the first sequence which Ergodic outp
C++实现二叉树很好的例子
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
二进制查找树实现代码
- 二进制查找树实现代码-achieve binary search tree code
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non - recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
将森林转化为二叉树
- 将森林转化为相应二叉树的算法-conversion of forest to the corresponding binary tree algorithm
判断二叉搜索树
- 判断一棵二叉树是否为二叉搜索树的算法-judge whether a binary tree search for the binary tree algorithm
哈夫曼树的实现
- 哈夫曼树的实现.-Huffman tree is realized.
二叉树的深度
- 用递归求出二叉树的深度-derived using recursive depth of the binary tree
二叉树改进041123
- 输入结点和结点数生成二叉树，可以左遍历，右遍历，后遍历！-input nodes and nodes generate binary tree can traverse left and right traverse, traverse after!
AVL树实现
- 纯C实现的AVL树，Demo是MFC的。非递归的遍历，完全支持添加、删除和搜索节点。设计灵活，容易扩展。以下是API struct tagAvlTree; typedef struct tagAvlTree AvlTree; struct tagAvlNode; typedef struct tagAvlNode AvlNode; struct tagAvlNode { AvlNode *left; AvlNode *right; int32_t height;
左右子树交换
- 左右子树交换