搜索资源列表
LVItemTree
- 可展开的树形listview,可以随意添加节点-Can be expanded tree listview, you can freely add the node
tree
- 二叉树，可实现增加节点，减少节点，删除等多种功能-Binary tree can add nodes to reduce the node, delete
xxhj
- 遍历先序后继二叉树，并查找指定结点的下一个结点-Find a the preorder successor to binary tree node
4_18
- 二叉树的前中后序遍历层次遍历，以及求节点数高度。求节点的父节点-Before, during and after the binary tree traversal hierarchy traversal, as well as the number of nodes required height. Find parent node
Desktopf
- 从输入的二叉排序树中删除一个结点。通过考虑该节点分别是叶节点，或只有左子树或右子树，或左右子树全不为空的状况-From the input binary sort tree to remove a node. By considering the node is a leaf node, respectively, or only a left subtree or right subtree, or left and right subtrees whole situation is not
ff
- 建立二叉树；对其进行遍历，遍历过程中输出结点的值；求出该二叉树的高度；并查询二叉树中是否 存在值为x的结点。 -Establish binary tree its traverse, the output node during the traversal value determined the height of the binary tree and query the existence of a binary tree node value is x.
a
- 设记录R[i]的关键字为R[i].KEY（1<=i<=k），树结点T[i]（1<=i<=K-1）指向败者记录，T[0]为全胜记录下标。写一算法产生对应上述R[i]（1<=i<= k）的败者树，要求除R[1..k]和T[0..k-1]以外，只用O(1)辅助空间。-Setting the recording R [i] is a keyword R [i] .KEY (1 < = i < = k), the tree node T [i] (1 < =
BinaryTree
- 算法当向该树插入一个元素时，若树中已存在该元素的关键码相同的结点，则该结点的count域加1；否则生成新的结点，并置该结点的count域为1-Algorithm when inserting an element to the tree, if the tree already exists the elements of the key code to the same node, then the node count domain plus 1 otherwise it produces