搜索资源列表
binary-tree
- 二叉树的创建，二叉树中结点的查找，测二叉树的深度宽度，输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
adt-tree
- 二叉排序树：又称二叉查找树。 它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th
Two-insert-search-tree
- 包含查找最大值、最小值的二叉搜索树方法，程序简洁明了-Binary search tree method comprising find the maximum, minimum, clear and concise program
code
- C语言写的可以查找最大字符串，二叉树查找结点。汇编程序。代码。-C language to find the maximum string, two fork tree search node. Assembler Code
koogham_balanced
- 编制一个程序实现平衡二叉树的三种基本功能查找,插入和删除(Compiled a program to achieve three basic function of the balanced binary tree search, insert and delete)