搜索资源列表
bi_tree
- 本程序包括三个功能：按前序遍历的方式创建二叉树、前序遍历显示二叉树、完全二叉树的判断。其中，#表示空树-the procedures include three functions : preorder ago by the creation of binary tree, the former preorder shows binary tree, complete binary tree judgment. Of these, # empty tree
yyh
- 对二叉树的生存,二叉树遍历等,有前序的,中序的,后序的,层次的,求结点数的等.
13094056703
- 一些经典CC++程序源码 1、 运动会分数统计** 2、 订票系统 3、拓扑排序4、 迷宫求解5、 文章编辑**6、 joseph环 7、 猴子选大王**8、 建立二叉树，层序、先序遍历（ 用递归或非递归的方法都可以）**9、 赫夫曼树的建立 10、 纸牌游戏**11、图的建立及输出
Binaryoperation
- 1．创建以二叉链表作存储结构的二叉树； 2．按前序遍历二叉树； 3．按中序遍历二叉树； 4．按后序遍历二叉树； 5．计算二叉树的单枝结点数； 6．按层次遍历二叉树。 -1. Create a list binary tree structure for storage 2. According to pre-order tree traversal 3. According to the binary tree traversal 4. After the tree
erchashubianliywc
- 只要就是用来实现二叉树遍历的功能，用c++语言实现的，是比较精简的数据结构。-erchashu bianli gongneng
binarytree
- 二叉树的遍历算法实现，其中包括先序 中序和后序遍历-Binary Tree Traversal Algorithm
cyuyanshixiandaima
- C语言就数据结构的实现代码，包括霍夫曼编码，图遍历，二叉树等-C language data structure on the implementation of code, including Huffman coding, graph traversal, binary tree and so on. . .
erchashu
- 采用二叉链表作为存储结构，完成二叉树的建立、前序、中序、后序和按层遍历的操作，并求出二叉树的高度、所有叶子及树结点总数的算法，输出二叉树的广义表表示-List using the binary storage structures, the establishment of complete binary tree, the former order, in order, the order and by level traversal of the operation, and calcula
BinaryTree
- 按先序输入二叉树 先序遍历二叉数 中序遍历二叉数 后遍历二叉数-By first order input visiting Binary Tree traversal binary number binary numbers in sequence after the number of traversing binary
Binary-tree-traversal
- 此源码是用来学习二叉树的各种遍历方法，相信正在学习数据结构的同学会用到。-This source is used to learn the binary tree traversal methods, I believe that students are learning data structures used.
BiTree
- 二叉树的构造和遍历,其中包括前序、中序、后序、层序遍历-The construction of bitree
c-erchashubianli
- 建立一棵二叉树，并对其进行遍历（先序、中序、后序），打印输出遍历结果。-Create a binary tree, and traverse the results of its traversal (preorder, inorder, postorder), print output.
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
BinarySearch_test
- 二叉树的构建如何实现二叉树对二叉树进行遍历以及二叉树的前序后续中序以及平横建树-How to build a binary tree on binary binary binary tree traversal and follow-up of the preamble sequence and flat horizontal achievements
Binary-Tree
- 本代码实现二叉树的先序，中序的递归算法及非递归算法，并用递归实现了后序遍历-This code implements the first binary sequence, sequence of recursive algorithms and non-recursive algorithm, and realized after using recursive traversal
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.
BTree
- 该程序利用C++实现二叉树的生成,遍历.与一般的二叉树生成程序不同的是:该程序使用面向对象的方式来实现-Create BinaryTree with C++
ercha
- 二叉树的层次遍历，执行后显示其执行过程，并显示其查找的点-Binary tree traversal level, showing its execution after execution, and displays its finding points
二叉搜索树的创建与遍历
- 简单描述了一个二叉搜索树的创建，并且进行先序，后序，中序遍历。(A simple descr iption of the creation of a two fork search tree, and the first order, after the order, in the order traversal.)