搜索资源列表
erchashu
- 数据结构中二叉树的遍历，对二叉树进行先序，中序，后序遍历，其中要用到循环查找-Traversing the binary tree data structure, the first sequence of binary tree, in order, post-order traversal, which use to find circular
erchashu
- 这是一个计算二叉树中叶子个数的程序，利用到，二叉树的遍历-This is a calculation of the number of leaves of a binary tree program, the use of that binary tree traversal
ERCHASHU
- 二叉树算式输入、遍历输出、根节点和非根节点数目计算-Binary formula input through output, calculate the number of root and non root
erchashu
- 这个程序是描写二叉树，希望对一些人有所帮助！-This procedure is a descr iption of a binary tree, hoping to be helpful for some people!
erchashu
- 假设一颗二叉树的先序序列为EBADCFHGIKJ和中序序列为ABCDEFGHIJK，请画出该树-Assuming a binary sequence of the first order and the order for the EBADCFHGIKJ sequence ABCDEFGHIJK, please draw the tree
erchashu
- 要求采用二叉链表作为存储结构，完成二叉树的建立，前序、中序和后序遍历的操作，求所有叶子及结点总数的操作等。具体实现要求：分别利用前序遍历、中序遍历、后序遍历所建二叉树。-Requires a list as a binary storage structure, the establishment of complete binary tree, the first order, the order and post order traversal of the operation, find
erchashu
- 实现一个二叉树类，要求实现二叉树的建立、结点插入、结点删除、线索化等操作。-to implement a binary tree class, required to achieve the establishment of a binary tree, node insertion, node deletion, threaded and other operations.
erchashu
- 二叉树的一些简单应用，如输出二叉树，求深度，高度等-Some simple binary applications, such as the output binary, seeking depth, height, etc.
erchashu
- 这是一个二叉树程序，实现二叉树求结点的功能-This is a binary tree program, seeking to achieve a binary tree node function
erchashu
- 实现用二叉树求两节点最近祖先的功能，方便实用-Seeking to achieve with a binary tree node recent ancestor of two functions, convenient and practical
erchashu
- 平衡二叉树操作，可以输入数字形成二叉树，可以进行添加、删除操作-Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete
erchashu
- 数据结构中二叉树的基本运算，包括二叉树的建立，销毁等-Binary tree data structure in the basic operations, including the establishment of a binary tree, destruction
erchashu
- 数据结构作业之一，具有的功能为先序读入二叉树数据，中序输出-One data structure operations, with a first order function reads binary data, the output sequence
erchashu
- 二叉树的存储和遍历 C语言 1、 递归算法实现遍历很简洁。 2、 在生成二叉树以后要把生成树的首地址带回来，所以要用的指向指针的指针。-Binary tree s storage and traverse C language
erchashu
- 建立一棵二叉树，并分别用前序、中序、后续遍历该二叉树。-The establishment of a binary tree, and were used pre-order, in order, follow-up traversal of the binary tree.
erchashu
- 数据结构课程中，有关二叉树问题的实现源程序-Binary tree data structure implementation source code
erchashu
- 二叉树的建立及后续遍历的演示，包括代码和报告。-Binary tree traversal of the establishment and subsequent demonstrations, including code and reports.
erchashu
- 该程序用于二叉树的实现，并用递归算法对该二叉树实现先根、对称、后根次序周游。-The program for the realization of the binary tree, and to the recursion algorithm realization binary tree root root order after the first symmetrical around
erchashu
- 建立一个二叉树并进行三种（前序，中序，后序）遍历-Establish a binary tree and three (former sequence, sequence, in the sequence) traverse
erchaSHU
- 在VC6.0中 对二叉树的实现 是数据结构与数据库里面的知识 -The realization of the binary tree