搜索资源列表
tree
- 设T是一棵具有n个结点的二叉树，若给定其先序和中序遍历序列，并假定其其先序和中序遍历序列分别存放于数组PreOder[n-1]和InOrder[n-1]中，试设计构造该二叉树链式存储结构的递归算法。-T is a set with n nodes of binary tree, if a given sequence and the sequence of its first traversal sequences, and assumed its first order and the ord
2chashu
- 生成如下二叉树，并用先序遍历输出结果 要求：用程序实现 说明：先生成如下所示的二叉树，然后先序遍历输出其结果：1243576 -Generate the following binary tree, and traversing the output with the first requirement: to achieve with the program Descr iption: President into the binary tree as shown below, a
BTree
- 二叉树的创建和遍历，初学者使用，没写好，不要见笑。-Binary tree creation and traversal
tautological
- 判断一个逻辑表达式是否是重言式，用户输入正确的逻辑表达式，计算机按照运算优先顺序生成二叉树，再用后序遍历得到逆波兰表达式，用逆波兰表达式来判断输入的表达式是否是重言式，用户也可以自己赋值来测试表达式的真假！-Determine whether a logical expression is a tautology, users enter the correct logical expression, the computer generates a binary tree in accord
BST
- 用二叉查找树对动态查找表的设计与实现，基本操作包括：构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素。-Binary search tree with the dynamic look-up table design and implementation of basic operations including: construction empty table, destroy the table, the search element of th
bitree
- 二叉树的建立与遍历，以及求二叉树的叶子节点数，节点数，树的深度等。并用主函数调用各个子函数，功能非常全。建立二叉树的原理是先把二叉树看成完全二叉树，然后对各节点编号，利用二叉树的性质建立二叉树。-Establishment of the binary tree traversal, and the demand nodes in binary tree leaves, nodes, depth of the tree. With the main function calls each sub
C7_TREE2
- 用C代码实现二叉树的三种遍历，其中用到图形库-C code implementation with three kinds of binary tree traversal, which use graphics library
erchashu
- 二叉树的操作 1.先序创建二叉树 2.中序递归遍历二叉树 3.先序非递归遍历二叉树 4.中序非递归遍历二叉树 5.后序非递归遍历二叉树 6.层次遍历二叉树 7.求二叉树的高度 8.求二叉树叶子数 9.退出程序-Binary operation 1. The first order to create a binary tree 2. In order recursive binary tree traversal 3. Preorder traver
Cpp1
- 实现二叉树的创建以及对其进行非递归前序遍历，路径输出等功能-To achieve the creation of a binary tree and its non-recursive preorder traversal of the path output function
shiyansi
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Stored using llink-rlink binary sort tree, the preparation of the keyboard input through the establishment of binary sort tree, and build complete immediately display the results of the
BinaryTree
- 二叉树的递归遍历，包括前中后三种遍历，并且采用先序输入-Recursive binary tree traversal
Bitree
- 二叉树的相关操作,建立，前序遍历，中序遍历，后序遍历-Binary tree-related operations, the establishment of preorder traversal, inorder traversal, after traversing
BTree
- 计算机数据结构：二叉树的前序、中序、后序遍历算法综合版-Computer data structures: binary tree preorder, inorder, postorder traversal algorithm for Science
1
- 二叉树的建立以及遍历环境win_tc 二叉树的建立以及遍历环境win_tc-The establishment of a binary tree and traverse the environment, and the establishment of a binary tree traversal win_tc environmental win_tc
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
lab2
- 利用广义表建立的二叉树，将碱基作为他的节点，实现了以树形输出，并且交换了左右子树，利用非递归中序遍历和先序遍历。-The establishment of the binary tree using the generalized form, the base node as he realized to the output tree, and the exchange of left and right sub-tree in the use of non-recursive travers
BinaryTree
- 二叉树的建立，非递归前中后序遍历，判断二叉树的相似，实现二叉树中左右子树的交换-The establishment of a binary tree, taken in the order of non-recursive traversal of binary tree similar to the judge, to achieve a binary tree in the exchange of left and right subtree
guangduyouxiansuanfa
- 用于遍历树目录的广度优先算法，用C#编写-Used to traverse the tree breadth-first algorithm, written using C#
Inorder_BiTree
- 二叉树的构造及遍历 Construction and traverse binary tree先序遍历输入再中序遍历输出-Binary tree structure and traversing Construction and traverse binary tree in preorder traversal sequence and then traverse the input output
Application_of_binary_tree_traversal_algorithm
- 二叉树遍历算法的应用 作者：李锐歆 建立二叉树 统计叶子结点个数 求二叉树的树深-Application of binary tree traversal algorithm: Li Ruixin Statistics leaf nodes to establish the number of binary tree binary tree seeking deep