搜索资源列表
btree
- 实现二叉树的后序的递归和非递归算法。 包括构造函数和析构函数。-After the realization of the sequence of binary tree recursive and non-recursive algorithm. Including the constructor and destructor.
Binarytreerecursiveltraversing
- 二叉树递归遍历 这是我们学校课程设计的一部分。能运行。-Recursive Binary Tree Traversal This is part of the design of the school curriculum. Will be able to run.
a
- 按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换-In accordance with the pre-order traversal non-recursive binary tree, binary tree recursive method will swap the left and right subtree
Tree
- 非递归先序，中序及后序遍历二叉树. 根据二叉树广义表的字符串创建二叉树-First non-recursive sequence, and after the sequence of binary tree traversal
bianli
- 建立二叉树用非递归方法对树进行遍历，其中用到了栈来保存中间数据。-The establishment of tree with non-recursive method to traverse the tree, which uses a stack to save the intermediate data.
fathersearch
- 先建立二叉树，然后用递归的方法寻找他的祖先检点并返回其标示。-To create binary tree, and then use recursive methods to find his ancestors and to return to their labeled indecent.
S020600210
- « 问题描述： 有时需要测试2 个数据结构的同构性，即2个同构的结构在相应的位置具有相同结点数 和分枝数。试设计一个递归函数用于测试2 棵二叉树是否同构。 « 实验任务： 对于给定的2 棵二叉树，计算这2 棵二叉树是否同构。-« Descr iption of the problem: sometimes need to test two data structures of the same configuration, that is, the
binarytreepaixu
- 本程序实现二叉树的操作，可以进行建立二叉树，递归先序、中序、后序遍历，非递归中序遍历等操作。-Binary tree of the program operation can be carried out to establish tree, recursive first order, in sequence, after the traversal of non-recursive traversal of the operation and so on.
shuju7
- 灵活运用非递归的遍历算法实现二叉树的其它各种运算；掌握按层次顺序遍历二叉树的方法；熟练掌握在中序线索二叉树上找给定结点的指定顺序下的前驱和后继的方法。-Flexibility in the use of non-recursive binary tree traversal algorithm to achieve a variety of other operations master-level order according to the method of binary tree tr
gezhongbianlisuanfa
- 各种二叉树的遍历算法，一共有9种，包括是先序遍历递归算法，非递归算法一，非递归算法二，同样后序，中序遍历也各有三种，很用心，都有注释，希望有所帮助-All kinds of binary tree traversal algorithm, a total of nine kinds, including the first recursive traversal algorithm, a non-recursive algorithms, non-recursive algorithm for
3.1
- 建立一棵二叉树，编写二叉树的前序遍历，中序遍历，后序遍历的递归算法与非递归算法-The establishment of a binary tree, the preparation of the first order binary tree traversal, in order traversal, postorder traversal of the recursive algorithm with non-recursive algorithm
erchashu
- 实现二叉树的前序非递归遍历和比较两棵二叉树是否相似的算法。-The realization of the first order binary tree non-recursive binary tree traversal and comparison of two algorithms are similar.
tree
- 数据结构习题之一，建立二叉树、先序非递归遍历、中序递归遍历、后序递归遍历，求叶节点数-Exercise one of the data structure, the establishment of binary tree, the first order traversal non-recursive, recursive in order traversal, postorder recursive traversal, and leaf nodes
TreeTraverse
- 二叉树的遍历操作，树结构用二叉链表存储，遍历时采用递归先序 中序 后序，层次遍历和非递归先序 中序 后序遍历-Binary tree traversal operations, binary tree structure list with storage, the use of recursive traversal sequence in the sequence after the first sequence, level and non-recursive traversal sequ
tree
- 二叉树的建立，遍历，查找等一些操作，包含递归遍历和非递归遍历-tree apply
InorderTraversal
- 中序遍历的递归算法定义： 若二叉树非空，则依次执行如下操作： (1)遍历左子树； (2)访问根结点； (3)遍历右子树。 -Traversal of the definition of the recursive algorithm: If the tree is not empty, then followed by the implementation of the following steps: (1) traverse the left subtree
shu
- 首先，实现二叉树的创建和中序递归遍历算法，在此基础上，进一步实现二叉树的其它递归遍历算法和横向打印算法，最后再增加二叉树的非递归遍历算法、删除子树等算法。-First of all, the realization of the binary tree in order to create and recursive traversal algorithm, On this basis, the further the other recursive binary tree traversal
sjjg
- Josephu问题,一元多项式的相加问题,模拟停车场管理问题,线性表的逆置算法,合并有序表,遍历二叉树（递归算法）,求二叉树的节点数、叶子数和深度（递归算法）,交换二叉树的左右孩子,有序表的折半查找,按递减次序输出二叉树中大于X的各元素的值,按递减次序输出二叉树中小于X的各元素的值,整理关键字使负值在前,冒泡排序-Josephu problem, the sum of one dollar polynomial problem, the issue of car park management
PreorderInorderPostorder
- 数据结构二叉树的建立与遍历，实验内容是以二叉链表作为存储结构，对建立的二叉树进行遍历（先序，中序，后序），采用递归方法实现。-Binary tree data structure and traversal of the establishment of the experimental binary content is stored as a linked list structure for the establishment of the binary tree traversal (f
anran
- 非递归的二叉排序树建立与维护，可以实现二叉树的修改、节点删除等-Non-recursive binary sort tree establishment and maintenance, the tree can be modified to delete nodes, etc.