搜索资源列表
erchashu1
- 建造二叉树、二叉树的前序、中序、后序、层序遍历-The construction of binary tree, binary tree of the former order, in sequence, after the sequence, sequence traversal
LevelVisit
- 我们了解二叉树的前序,中序和后序遍历,那么设计一个程序实线二叉树的层次遍历-We understand that the first order binary tree, in sequence and post-order traversal, then design a program of line-level binary tree traversal
tree
- 二叉树的前序，中序，后序，遍历等一系列操作-Binary tree preorder, inorder, postorder, traversing a series of operations
erchashu
- 实现二叉树的基本功能，包括前序遍历，中序遍历，后序遍历，层次遍历-To achieve the basic functions of a binary tree, including the pre-order traversal, inorder traversal, postorder, level traversal
BinaryTree
- 二叉树的相关操作，实现前序，中序，后序遍历，算元素个数，树高-Binary tree-related operations, to achieve pre-order, middle order, postorder, count number of elements, tree height,
BT
- 二叉树的前序遍历以及中序遍历以及后序遍历-BinaryTree
binaryTree
- 根据输入的谦虚序列，终须序列获得二叉树，从而进行“前序”“中序”“后序”“层次”遍历，支持单步演示以及自动演示-Eventually have modest sequence based on the input sequence obtained binary tree, thus the " preamble" in order " after the sequence" hierarchy traversal supports single-step d
BinaryTree
- 包括二叉树的前序、中序、后序递归非递归遍历；以及线索二叉树的前序、中序、后序递归非递归实现。-Include binary tree preorder, inorder, postorder recursive non-recursive traversal threaded binary preorder, inorder, postorder recursive non-recursive implementation.
bitree
- 此程序可用于演示二叉树的前序、中序和后序遍历。-This program can be used to demonstrate the binary tree preorder, inorder, and postorder traversal.
BinaryTree
- 使用VS2010编程，二叉树的前序、中序、后序、层序遍历，无界面。-Using VS2010 programming, binary tree sequence, sequence after sequence, sequence traversal, no interface.
binarytree
- 二叉树以lson-rson链接方式存储，以菜单方式设计并完成功能任务：建立并存储树、输出前序遍历结果、输出中序遍历结果、输出后序遍历结果、交换左右子树、统计高度，其中对于中序、后序的遍历运算要求采用非递归方式。-Binary links to lson-rson stored to design the menu and complete functional tasks: Create and store the tree, the output results before preorder
BinaryTree
- 二叉树类的全部实现：建树、清空、判空、找根节点、找父节点、找子节点、剪枝、前序遍历、中序遍历、后序遍历和层次遍历、判断是否为完全二叉树。-All binary tree class: achievements, empty, empty sentence, find the root node, find the parent node, find the child nodes, pruning, preorder, preorder, postorder traversal and leve
NO6
- 剑指offer，输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并输出它的后序遍历序列。-An offer, enter the preamble of a binary tree traversal and sequence traversal results in reconstruction of the bin
erchashu
- 二叉树的建立，前序遍历。中序遍历，后序遍历，数据结构课程设计。-Establishment of a binary tree, preorder traversal. Preorder, postorder traversal, data structures course design.
Test4_19B
- 二叉树的前序遍历，中序遍历，后序遍历，实现了迭代其的使用-Pre-order binary tree traversal, preorder, after preorder realized iteration of its use
erchashu
- 进行一些二叉树的基本操作：1) 前序遍历：将二叉树按前序遍历输出； 2) 中序遍历：将二叉树按前序遍历输出； 3) 后序遍历：将二叉树按前序遍历输出； 4) 层序遍历：将二叉树按前序遍历输出； 5) 求高度：求出二叉树的高度； 6) 求最大宽度：求出二叉树的最大宽度； 7) 判断是否满二叉树： 判断所输入的二叉树是否满二叉树； -Some binary basic steps: 1) pre-order traversal: preorder output binar
main
- 二叉树的前中后序遍历，利用链表和栈来实现。-Before the binary tree traversal after
wq
- 本程序的要求是给出一个二叉树的中序和后序遍历，运用递归和非递归两种方法确定二叉树，并输出二叉树的前序序列和显示二叉树的树形结构。-The requirements of this program is to give a binary tree in inorder and preorder using recursive and non-recursive two methods to determine the binary tree, and outputs the preamble se
二叉树遍历
- 简单的二叉树遍历，中序遍历，后序遍历，前序遍历(Simple two tree traversal)
bintree
- 主要为二叉树的遍历，涉及到前序遍历、中序遍历、后序遍历，以及左右孩子的交换后的遍历（内附c&c++操作手册）(It is mainly used for binary tree.)