搜索资源列表
delet1
- 编写递归算法：对于二叉树中每一个元素值为x的结点，删去以它为根的子树，并释放相应的空间。-Write a recursive algorithm: the value for each element in the binary tree node x, by deleting sub-tree root and release the appropriate space.
traver
- 编写算法完成下列操作：无重复地输出以孩子兄弟链表存储的树T中所有的边（这里的边是指树T本身的分支，而不是孩子兄弟链表所形成的二叉树的分支）。输出的形式为（k1, k2）, ..., (ki, kj), ..., 其中，ki和kj为树结点中的结点标识。-Write an algorithm to do the following: no repeat output to all sides in children the brothers linked list storage tree T (
btnode
- NILFS B-tree node cache driver for Linux.
Cpp1
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu5876
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
vc-tre
- VC.NET如何使用树形控件，本例以读取磁盘分区和目录为例，向VC++.NET学习者展示树控菜单如何使用，在本程序中，点击树形的节点，会展开二级的目录树，当然还可以继续向下展开，不过方法已经演示给大家了，需要展开多少级就自己动手实现吧。-The how VC.NET use tree controls, in this case to read the disk partition and directory, for example, show how to use the tree cont
binary-tree
- 1．掌握二叉树的概念和性质 2. 掌握完全二叉树存储结构。 3．掌握完全二叉树的基本操作 4.创建完全二叉树（用字母表示节点）(用顺序方式存储) 5.求二叉树的深度和叶子结点数 6.实现二叉树的前序、中序、后序和层次遍历。 7.查找给定结点的双亲、祖先和左右孩子节点。 -1. Grasp the concept and nature of the binary tree master the complete binary tree storage stru
tree
- 使用python语言写的二叉树,总共两个文件，一个是树，一个是节点-binary tree by python which contains a tree Class and a Node class
tnc
- This file implements TNC (Tree Node Cache) which caches indexing nodes of the UBIFS B-tree.-This file implements TNC (Tree Node Cache) which caches indexing nodes of the UBIFS B-tree.
tree
- 创建二叉树，按顺序输入各节点的数据，返回该二叉树的中序遍历结果。-Create a binary tree, in order to enter the data of each node, and returns the binary tree traversal sequence results.
treedata
- VC++操作Tree控件，点击TRee的节点可依次展开二级节点，Tree节点应用是相当广泛的。要运行程序必须将数据库文件夹Database（包含数据库文件City.mdb）与可执行文件放在一起-VC++ to operate the Tree control, click Tree nodes can expand the secondary node the Tree node application is quite extensive. To run the program must be
BiTree
- 二叉树操作程序，实现了动态创建二叉树，中序遍历二叉树，节点删除等。-Binary tree procedures, the creation of dynamic binary tree traversal of binary tree node delete.
lab05
- 本用例为二叉树结点的结构和对二叉树的基本操作，设计二叉树的构造、销毁、各种递归的实现等。-This use case binary tree node structure and the basic operation of the binary tree, binary tree structure design, destruction, the various recursive implementation.
BinarySortTree
- 二叉排序树的查找、插入和删除 要求：在屏幕上表示出二叉查找树的结构，用到的抽象数据类型为元素数据类型和二叉树结点类型。 -Binary sort tree search, insert, and delete requirements: binary search tree structure is shown on the screen, the abstract data types used for the element data type and the binary tree
Tree
- 二叉查找树和哈夫曼树的实现，实现节点的删除（包括根节点的删除，带有两个节点的删除，等），节点的查找，插入。-Binary search trees and Huffman tree, has implemented the deletion of nodes (including the root node is deleted, with two nodes removed, etc.), the node lookup, insertion.
Representing-and-Operating-on-an-N-inary-Tree-V3.
- This representation is a bit annoying because the kids array must be allocated separately from the node, and you need to reallocate the kids array every time you add a new kid to a node. Alternatively, you could instead over-allocate in anticipation
Exp2_RedBlackTree
- 由节点数据建立红黑树，以及插入节点、查找数据，中间包括红黑树的调整操作。-Established by a red-black tree node data, as well as insert nodes, find data, including the middle of the red-black tree adjustment operation.
6-44
- 编写递归算法：求二叉树中以元素值为x的节点为根的子树的深度-Write a recursive algorithm: the value of an element in the binary tree node x is the depth of the subtree rooted
LeastCommonAncestors
- 求一棵二叉树的2个结点的最近公共祖先 输入：根据带空指针的先序遍历结果建立普通二叉树 数据元素类型：字符类型 空指针: # 输入格式： 第一行：依次为元素个数N 第二行：元素序列 第三行：字符x 字符y 输出格式：x与y的最近共同祖先的元素值，或者NULL。 注意：1、输入错误时，输出ERROR（大写）并结束程序。2、树节点保存的元素值为字符类型。3、任意多余输出视为错误。4、二叉树的结点关键字是主关键字 -Seeking a binary tree