搜索资源列表
BinarySearchTree
- 二叉搜索树的各种基本操作，各种遍历的递归和非递归实现，还有输出在指定范围的节点等-Binary search tree, variety of basic operations, a variety of traversal recursive and non-recursive implementation, as well as output in the specified range of nodes, etc.
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序，中序，后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
DataStructure
- 二叉查找树数据结构及基本操作，前序遍历，中序遍历，以及其非递归算法-Binary search tree data structure and basic operation, pre-order traversal, inorder traversal, as well as its non-recursive algorithm
6.1
- 实现非递归二叉排序树的插入和创建,并用中序遍历检验-To achieve non-recursive binary tree insertion sort and create and use in order traversal test
Bidirectional-quadtree-in-matlab
- matlab 中实现一个四叉树的结构,使用递归过程，整合成一次二向遍历-secure yourself with a simple quadtree in matlab
BinTree
- 二叉排序树，实现树的各种操作，包括计算深度，找最大值最小值，还有各种遍历的递归算法和非递归算法，以及查找查找树的前驱节点和后继节点-Binary sort tree, the tree to achieve various operations, including the calculation of depth, looking for maximum minimum, there are various recursive traversal algorithm and non-recur
applxcbtion-escape-marshal
- 按先序扩展序列建立二叉树,先序,中序,后序遍历的递归算法,不错-According to the first sequence extension set up binary tree, first order, in sequence, after the sequence traversal recursive algorithm, good
sevuesce
- 按先序扩展序列建立二叉树,先序,中序,后序遍历的递归算法,不错-According to the first sequence extension set up binary tree, first order, in sequence, after the sequence traversal recursive algorithm, good
main
- 哈夫曼树，二叉哈夫曼树的建立（两种方式），以及三种遍历方式（递归与非递归）-The haffman tree, the creation of the binary hafman tree (two ways), and the three ways of traversing (recursion and non-recursion)
shujujiegou-shu
- 有关数据结构树的相关内容 写出中序遍历二叉树的递归算法和非递归算法。 给定一棵用链表表示的二叉树，其根指针为root，试写出求二叉树结点数目。-Relevant content of data structure tree
tet
- 按先序扩展序列建立二叉树,先序,中序,后序遍历的递归算法,不错(According to the first sequence extension set up binary tree, first order, in sequence, after the sequence traversal recursive algorithm, good)
lxhxgb
- 按先序扩展序列建立二叉树,先序,中序,后序遍历的递归算法,不错(According to the first sequence extension set up binary tree, first order, in sequence, after the sequence traversal recursive algorithm, good)
BiTR
- 生成一棵以二叉链表存储的二叉树bt（不少于15个结点）。 2） 分别用递归和非递归方法前序遍历bt，并以缩格形式打印bt上各结点的信息。 3） 编写算法，交换bt上所有结点的左、右子树，并以缩格形式打印出交换前后的bt结点信息。(Generate a two fork tree BT (no less than 15 nodes) stored with a two chain list. 2) the BT is traversed with the preorder of recursive