搜索资源列表
traverse
- 输入一个二叉树的前序和中序遍历，程序给出此二叉树的后续遍历。-Input a preorder traversal and a midorder traversal of a binary tree.The program will show the after traversal of the binary tree.
BinaryTree
- （1）根据给定二叉树的先序遍历和中序遍历结果，构造出该二叉树； （2）给出该二叉树的后序遍历结果； （3）判定该二叉树是否为平衡二叉树； -(1) According to the given binary tree preorder traversal and inorder traversal a result, constructed out of the binary tree (2) given in the post-order traversal of the bin
tree
- 二叉树的前序，中序，后序，遍历等一系列操作-Binary tree preorder, inorder, postorder, traversing a series of operations
a
- 二叉树的先序递归非递归遍历，中序递归非递归遍历，后序递归非递归遍历，以及节点数-Binary tree preorder recursive traversal non-recursive, recursive sequence of non-recursive traversal, postorder recursive non-recursive traversal. As well as the nodes
pretree
- 采用C语言编写的先序遍历二叉树的源程序，该程序有3部分构成：主程序，构造树函数，先序遍历函数-Written in C language using the first order binary tree traversal of the source, the program has three parts: the main program, construct a tree function, preorder traversal function
erchashu
- 可以创建二叉树，先序遍历二叉树，后序遍历二叉树，按层遍历二叉树，交换左右子树并输出-You can create a binary tree, binary tree preorder traversal, postorder binary tree, by traversing a binary tree level exchange of left sub-tree and output
BinarySearchTree
- 关于二叉树的11种操作，包括二叉树的创建，检验是否为空，求二叉树的深度，二叉树的查找，前序遍历，后序遍历，按层遍历-it is about 11 kinds of binary search tree,including creating,the depth of the tree,postorder,preorder,level of order....
TreeProject
- This program is used to construct a tree, given its inorder and preorder or inorder and postorder traversals.Graphical display of the constructed tree has also been done
BiTreeAll
- 使用二叉链表实现二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 -Use two forks linked to achieve the basic functions of a binary tree: 1, the establishment of two binary tree, preorder traversal b
bitree
- 用遞歸的前序遍歷方法實現二叉樹的建立，並且用前序遍歷來輸出值，適合新學習編程人員熟悉操作用-Using recursive preorder traversal method to achieve the establishment of a binary tree, and used to output the value pre-order traversal for programmers familiar with the operation of the new study used
homework
- 设二叉树的结点的数据场之值仅为一大写英文字母。其前序和中序的遍历结果（打印结点的数据场之值）分别保存在字符串数组 preorder[N] 及 inorder[N]之中，其中 N 为常数。请设计程序以标准形式存储保存该二叉树。-Based binary tree node data field of the value is only a capital letter. The pre-order traversal order and the results (the data field t
FrameC_V0_4
- 1. 这是对之前MyOOCFwV1_0(http://www.pudn.com/downloads229/sourcecode/middleware/detail1079540.html)的完善，解决了之前的bug 2. 新添源码(src目录下)：CharString、链式栈、链式队列、先序二叉树 3. 新添测试代码，放在test目录下 4. 运行环境：Linux + Eclipse IDE for C/C++ Developers-1. This is the improved v
Huffman
- 数据结构 c语言/c++ 哈夫曼树先序中序遍历得到后序层序遍历-Data structures c Language/c++ Huffman tree in preorder traversal is the order traversal
binary
- 已知二叉树前序中序周游，求后续周游的算法-Known sequence in the binary tree preorder traversal, and request follow-up traversal algorithm
ADT-tree
- 编写二叉树的基本操作函数，用递归方法分别实现先序，中序和后序遍历二叉树。-The preparation of the basic operating functions of the binary tree, recursive preorder, inorder, and postorder traversing a binary tree.
shuju-jiegou
- 树和二叉树的中序 后序 先序 遍历 二叉树的宽度 -The width of the tree and binary tree in sequence after sequence a preorder traversal of binary tree
erchashubianli
- 二叉树遍历，实现二叉树的遍历，有中序遍历，前序遍历，后序遍历三种-Binary tree traversal, binary tree traversal, the traversal, preorder traversal, after the traversal of three
tree
- 二叉树的先序，中序，后序，层序的递归，非递归遍历-Binary tree preorder, inorder, postorder, the sequence of recursive, non-recursive traversal
dictionary-order
- 将一段以“*”结束的文本中的单词按照字典序打印出来，并且打印出该单词在正文中出现的次数； 将单词按字典次序存入一棵二叉排序树，第一个存入的单词为二叉树的根，读完文件中的单词后按中序遍历打印单词-Print out the words in the period of the end of the text " *" in accordance with the lexicographical, and print out the number of occurrences
0304
- 对一组输入数据构建相应的二叉排序树，并利用其中序遍历（原来打错了）对数据进行升序排序。-Corresponding binary sort tree to build a set of input data, and to which preorder traversal (original wrong) data in ascending order.