搜索资源列表
btree
- 树型结构上机作业 1 建立二叉树 1)通过输入树的嵌套括号表示序列 2)根据前序遍历序列和中序遍历序列建立二叉树 3)建立哈夫曼树 2. 对于1中1),2)所建立的树进行如下操作: 1)查找结点 2)前序遍历 3)中序遍历 3 对于建立的哈夫曼树进行编码 4 输出二叉树的形状 -Operating a tree structure on the plane to establish binary 1), enter the tree th
code
- 本程序采用二叉树的数据结构,,以作为家谱成员及信息(profile)的存储结构,,个人信息包括姓名,,性别,配偶,出生,死亡日期等,,还包括人物编号ID,,附加信息(便于以后扩展需要),以二叉树的遍历搜索,修改,增加,删除等作为核心算法,,并通过MFC界面显示出来,,以windows树结构来展示底层的家谱信息.-family tree
binaryTree
- 本程序用二叉树类实现了从键盘输入二叉树的两种遍历结果,在内存中建立二叉链表,根据遍历结果恢复该二叉树,并在屏幕上显示该二叉树。整个程序采用多文件,一个头文件,一个函数实现文件,以及主函数所在文件。-The program uses a binary tree class implements a binary tree from two keyboard traversal results in memory to create the binary list, according to res
tree
- 二叉树的遍历,用先序创建二叉树,再用先序、中序、后序递归遍历二叉树。-Binary tree traversal, with the first order to create a binary tree, then the first order, in order, the order of recursive binary tree traversal.
shuyuerchashu
- (1)输入字符序列,建立二叉链表。 (2)先序,中序,后序遍历二叉树:递归算法。 (3)中序遍历二叉树:非递归算法(最好也能实现先序,后序非递归算法)。 (4)求二叉树的高度 。 (5)求二叉树的叶子个数。 (6)对于树中每一个元素值为x的结点,删去以它为根的子树,并释放相应的空间。 (7)借助队列实现二叉树的层次遍历。 -shu yu er cha shu
cBinaryTree
- 数据结构,二叉树的应用, 树的遍历,大部分是别人的, 只改了一下-data struct
5235
- 本代码实现了数据结构二叉树的遍历转化 容易 易懂 -This code implements the traversal binary tree data structure is easy to understand conversion
BiTree
- 根据二叉树表的表示建立二叉树,实现二叉树的遍历,并给出从根结点到给定结点的路径信息。练习二叉树的链式存储及其遍历方法-According to the table that the establishment of a binary tree binary tree, binary tree traversal implementation, and give from the root node to a given node' s path information. Practice
binary
- 实现二叉树的遍历及应用。C++编写,运行速度较快。-Implementation and application of binary tree traversal. C++ is written to run faster.
BiTree_MFC
- C++ MFC,实现二叉树的遍历(前序、中序、后序)可自行添加节点-C++ MFC, to achieve the binary tree traversal (preorder, inorder, postorder) can add their own nodes
tree
- 用C语言写的树的生成、树的遍历,并含有9种排序算法-Written in C language with the generation of trees, tree traversal, and contains nine kinds of sorting algorithms
circlelist
- 利用c语言实现二叉树的遍历,先序后序中序-Using c language binary tree traversal, the first order in the sequence after sequence
BinaryTree
- 利用数据结构,c语言,实现二叉树的遍历,递归非递归-Use of data structures, c language, to achieve binary tree traversal, recursive non-recursive
fwd3
- 利用C++语言,实现二叉树的遍历,前序中序后序,层序,递归非递归-Using C++ language, to achieve binary tree traversal, pre-order in the sequence after sequence, sequence, recursive non-recursive
CppApplication_10_2_1
- 利用c++,栈,队列的方法,解决二叉树的遍历,递归非递归-Using c++, stacks, queues, solutions to the binary tree traversal, recursive non-recursive
Tree
- 首先以广义表的形式输入一棵树,并且由程序建立,再依次实现对树的先序,中序,后序的遍历-preoder,inorder and postorder of a tree
AVLtreeopertion
- 一个AVL树的遍历算法程序,对于初学数据结构,C语言的人来说是个较好的例子-An AVL tree traversal algorithm program data structure for the beginner, C language of the people is a good example of
erchashu
- 二叉树的遍历二叉树的创建遍历中序前序后序-The creation of binary tree traversing a binary tree inorder traversal sequence after the pre-order
erchashu
- 系统应具备的功能: (1)建立二叉排序树; (2)中序遍历二叉排序树并输出排序结果; -System should have the function: (1) the establishment of binary sort tree (2) in the binary sort tree traversal and output sort the results
Tree
- 二叉树的遍历及显示,递归先序,递归中序遍历,递归后续遍历-Binary tree traversal and display