搜索资源列表
erchashu
- 基于C环境的《数据结构》课程中二叉树的源代码。-Based on the source code of the binary tree data structures course in C environment.
erchashu
- 设计程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数-Design procedures to achieve binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure type, as well as each operation of the spec
erchashu
- 用vc++写二叉树排序算法程序实现简单的输入输出-Vc++ to write simple input and output binary tree sort algorithm
erchashu
- 该代码实现的主要功能是实现二叉树算法的运算-The code to achieve the main function is to achieve the Binary Tree Algorithm
erchashu
- 数据结构中二叉树的基本操作，如先序，中序，后序遍历，递归和非递归遍历-Basic operation binary tree data structure, such as the first-order, in-order, post-order traversal, recursive and non-recursive traversal
xiansuo-erchashu
- 该程序是在VS2012环境中用C编写的关于线索二叉树的问题，请学数据结构的同志参考-inary tree data structure problem, please refer to the comrades
erchashu
- 线索二叉树的应用，实现中序线索二叉树建立，实现自前向后和自后向前的递推遍历-typedef enum PointerTag
erchashu
- 数据结构课程设计，二叉平衡树实现学生管理系统，学生信息用文件保存，添加，删除，修改等操作。-Data structure curriculum design, binary balanced tree implementation student management system, students information is saved with the file, add, delete, modify, and other operations.
erchashu
- 实现二叉树的新建，树深度叶节点的计算，实现二叉树的遍历-Achieve new calculation of the depth of the leaf node in the tree, the binary tree binary tree traversal
erchashu
- 数据结构实验：在一棵树中，用中序对其进行线索化-Experimental data structure: in a tree, inorder to its threaded
erchashu
- 假设自上而下按层次，自左至右输入每个结点的一个三元组(N, P, L/R)。其中N为本结点的元素，P为其夫结点，L指示N为P 的左孩子，R指示N为P的右孩子。试写一个建立二元树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 -Assuming that the top-down hierarchy, from left to right input each node is a triple (N, P, L/R). N oriented junction element t
erchashu
- 先序扩展序列建立二叉树,二叉树的先序,中序,后序遍历的递归与非递归算法,层序遍历,以及求树的深度.-First order expansion preorder, inorder, postorder traversal sequence to establish binary tree, binary tree recursive and non-recursive algorithm, the depth of the layer preorder traversal, as well as
erchashu
- VC++编程，实现二叉树的创建及遍历。北航软件技术基础作业。-VC++ programming, to create and traverse a binary tree.
erchashu
- 验证二叉树的二叉链表表示，实现CreateBiTree算法创建二叉树，实现二叉树的层次遍历算法，实现二叉树的先序、中序、后序递归遍历算法中的一种，编写主程序调用CreateBiTree创建二叉树，并调用二叉树的层次遍历、先（中、后）序遍历算法，测试不同的输入数据创建二叉树，预期输出并验证输出的结果。 -The binary list validation binary tree the preorder achieve CreateBiTree algorithms to create a
erchashu
- 构建二叉树：输入二叉树的结点和前序、中序、后序遍历，结果输出一颗二叉树-er cha shu
erchashu
- 关于二叉树的综合实验，有创建、遍历、统计结点数、统计叶子数等操作。-Comprehensive experiments on binary tree, create, traverse, the operation of the statistics of the number of nodes, number of statistics leaves.
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
erchashu
- 使用c#完成数据结构里的二叉树，并使用中序遍历进行查找，适合初学者学习二叉树的使用-Use c# to complete the binary tree data structure, and to find the preorder, suitable for beginners to learn the use of a binary tree
erchashu
- 完成二叉树的深度优先非递归周游和广度优先周游-Complete binary tree non-recursive traversal depth-first and breadth-first traversal
erchashu
- 二叉树的基本操作,1. 建二叉树 2. 先序遍历 3. 中序遍历 4. 后序遍历 -The basic operation of the binary tree