搜索资源列表
na3
- 实现二叉排序树的插入，生成二叉排序树，二叉排序树的查找，二叉排序树的删除，先序遍历输出二叉树-To achieve binary tree insertion sort, binary sort tree generation, binary search tree sort, binary sort tree to remove the first order binary tree traversal output
sjjg
- Josephu问题,一元多项式的相加问题,模拟停车场管理问题,线性表的逆置算法,合并有序表,遍历二叉树（递归算法）,求二叉树的节点数、叶子数和深度（递归算法）,交换二叉树的左右孩子,有序表的折半查找,按递减次序输出二叉树中大于X的各元素的值,按递减次序输出二叉树中小于X的各元素的值,整理关键字使负值在前,冒泡排序-Josephu problem, the sum of one dollar polynomial problem, the issue of car park management
ccc
- 先生成一棵二叉树，再用中序遍历方式打印每个结点值，并统计其叶子结点的个数。-Mr. into a binary tree, and then traverse the way in order to print the value of each node, and statistics of its number of leaf nodes.
ThreadingTree
- 线索二叉树的实现 包括先序次序遍历先序二叉树 中序次序遍历中序二叉树 将值为x的结点作为先序二叉树T的左子 中序次序线索化二叉树 后序次序线索化二叉树-Clues to the realization of binary tree, including the order of the first order binary tree traversal sequence to sequence the order of traversal of binary tree in order to v
hufmtreehuatu
- 一段小程序 数据结构的哈夫曼树以及画图 画图是Graphics画的 按照先序遍历的顺序-huffman tree
datastructure
- 这是一个数据结构课程设计，里面包含有文章编辑、迷宫求解、建立二叉树，层序、先序遍历、各种排序四个程序，对初学者来说有一定的帮助。-This is a data structure of the curriculum design, which contains articles editors, maze solving, the establishment of tree, sequence, first traversal, all four procedures to sort of ha
ecs
- 这是一个通过c++编译的能够实现二叉树的先序，中序，后序遍历的程序，输入时要按照例子的要求输入，否则不可辨认-This is a through c++ compiler can be achieved in the first order binary tree, in order, after the traversal of the procedure, type the request in accordance with the examples of input, can not i
BinTree
- 创建二叉树,然后先序,中序,后序遍历二叉树中的各元素.-Create a binary tree, and then the first order, in sequence, after the tree traversal of the element.
Tree
- 树的各种遍历方法的整合，并且具有它们相互的比较，界面人性化-The various methods of tree traversal integration, and has compared them to each other, user-friendly interface
12315641315
- 1．输入n个结点的权值和字符，不断选择最小值和次小值建成HUFFMAN树，如果从叶结点开始向上遍历译成HUFFMAN编码。然后把每个字符对应的码值显示出来。 2．输入任意字符串，转化成HUFFMAN编码 3．输入任意HUFFMAN编码，转化为字符串。 原理： 从给定的叶子及树重中选择最小和次小的两棵树构成一棵新树，所得的和放入森林中继续比较，重复以上步骤，直到仅剩一棵树，即为哈夫曼树。 -make your 123156131554
jyhygjyghj
- 线索二叉树 建立中序线索二叉树，并且中序遍历 求中序线索二叉树上已知结点中序的前驱和后继；-Binary tree in order to establish clues clues tree, and in the traversal sequence for clues in the binary tree nodes on the known sequence of the precursor and follow-up
NON
- 实现二叉树三种遍历（先序遍历、中序遍历、后序遍历）的非递归算法。-The realization of the three binary tree traversal(PreOrderTraverse,In OrderTraverse,PostOrderTraversal)of the non-recursive algorithm.
hh
- 用递归实现二叉树的先序,中序,后序3种遍历.-Binary tree with recursive realization of the first order, in sequence, the latter three kinds of traversal sequence.
222
- 实现了二叉树的相关操作，大致包括如下内容：1 建树 2 各种遍历：前序 中序 后序 层次遍历 3 搜索 4 插入 5 删除 6 显示等。 -Related to the achievement of a binary tree operation, generally include the following: 1 contribution to the various traverse 2: pre-order level in the traversal sequence after
02-04-29
- 建立一个二叉树以及二叉树的后序遍历算法的演示-The establishment of a binary tree and binary tree traversal algorithm, after the demonstration
ThreadTree_innext
- 中序遍历的递归算法定义： 若二叉树非空，则依次执行如下操作：(1)遍历左子树；(2)访问根结点；(3)遍历右子树。-ThreadTree_innext
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
rebuild
- 树重建问题。 给出树的后序、中序遍历顺序，求出数的前序遍历顺序。-Tree reconstruction. After the tree given sequence, the order of traversal, the number of pre-calculated sequence traversal.
binarytreeandinsort
- 二叉排序树及其中序遍历，程序首先对随机生成的数建立二叉排序树，然后在对其进行中序遍历-Binary sort tree and the traversal, the program first to establish a number of randomly generated binary sort tree, and then in their order of traversal
include
- 用一个结构体存储每个节点，每个结构体包括一个char 和指向左右孩子的指针，每次扫进来它自身的char和i， 如果i为偶则放进左子树，否则放进右子树。然后就是利用递归前序遍历此树-Structure with a store on each node, each structure includes a char and a pointer to the children about each sweep into its own char and i, for even if i was in