搜索资源列表
BinaryTree
- 二叉树，所有关于二叉树的一般代码，我自己的作业
tree1
- 顺序存储二叉树 程序有简单的二叉树的输入，输出、查找、删除， 简单易懂-Sequence of binary tree stored procedures are simple binary tree of the import, export, find, delete, easy-to-read
4
- 1. 建立自己的头文件BT.H，内容包括二叉链表的结构描述、二叉树的建立、二叉树的先序、中序与后序遍历算法。 2. 建立二叉树,并通过调用函数,，输出先序遍历、中序遍历与后序遍历的结果。 -1. To establish their own header files BT.H, including the structure of linked list binary descr iption of the establishment of binary tree, binary tre
11
- 二叉树遍历及深度，使用C语言实现，课程设计-Binary tree traversal and depth of C language, curriculum design
erchashu
- 本程序包括二叉树的创建，各种遍历方法(前序，中序，后序以及各层算法）。-This process includes the creation of a binary tree, various traversal methods (pre-order, middle order, post order, and layers of algorithm).
4643165
- 二叉树三种遍历算法的源码，强大的学习工具，一定要看的-Three kinds of binary tree traversal algorithm source code, a powerful learning tool, be sure to look at
AVL
- 二叉平衡树AVL的插入和删除的C实现源码，和大家分享一下，-Binary balanced tree insertion and deletion of the AVL implemented in C source code, and share with you, thank you
cstree
- 分布式数据库中逻辑计划树生产代码，是以二叉树形式构建的-Logical plan tree production code in a distributed database is a binary tree constructed in the form of
Tree
- 建立一棵二叉树，用二叉链表存储二叉树，计算二叉树中包含的结点个数-A binary tree, using the the binary list stored binary tree to calculate the number of nodes in a binary tree contains
erchashu
- 用下面两种方法中的任一种建立y一棵n层的满二叉树。 (1) 按先序遍历递归调用建立链式满二叉树； (2) 按层序遍历二叉树方式建立链式满二叉树。 （3）把二叉树得凹入表示法打印出来 -Use either of the following two methods to establish a y a n-tier full binary tree. (1) according to preorder a recursive call to establish a chain fu
erchashubianli
- 对所建立的二叉树用递归和非递归的中序遍历输出树的结点的算法。-Established algorithm for binary output node of the tree using recursive and non-recursive preorder.
Chain-binary-tree
- 用VC6.0编写的关于数据结构的链式二叉树算法和代码-About chain binary tree data structure algorithms and code VC6.0 prepared
datastructure
- 包含一些数据结构的习题，实现了学生信息表的查询等功能。(Contains some of the data structure exercises, to achieve the student information query table.)