搜索资源列表
BiTree分割视图版
- 将视图分割成两部分，左边为显示取，右边为数据录入区，每录入一个节点数据，立即在左边显示节点图形，能实现二叉树的插入、删除、前序遍历、中序遍历、后序遍历。-View will be divided into two parts, shown from left to right for the data entry areas, each node a data entry immediately on the left shows nodes graphics can achieve binar
BinTreeExp
- 二叉树的创建、前序递归遍历、中序递归遍历、后序递归遍历、层次遍历、前序非递归遍历、中序非递归遍历、后序非递归遍历算法。里面包含了顺序栈和队列的实现代码。-Binary tree creation, pre-order recursive traversal, recursive in order traversal, postorder recursive traversal, traverse the level, pre-order traversal non-recursive, in t
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
ProBinaryTree
- 主要实现二叉树的建立，前序，中序，后序，和层序遍历，及实现前序，中序，后序，和层序输出-Main achieved the establishment of a binary tree, the former sequence, the sequence, after the sequence, and sequence traversal, and the realization of pre-order, middle order, post order, and the output se
erchashu
- 实现二叉树的基本功能，包括前序遍历，中序遍历，后序遍历，层次遍历-To achieve the basic functions of a binary tree, including the pre-order traversal, inorder traversal, postorder, level traversal
BT
- 二叉树的前序遍历以及中序遍历以及后序遍历-BinaryTree
tree
- 程序功能：选择二叉链式存储结构作为二叉树的存储结构，设计一个程序实现二叉树的基本操作 （包括建立、输出、前序遍历、中序遍历、后序遍历、求树高、统计叶子总数等）-Program features: Choose binary chain store structure as the binary tree memory structure, design a program to achieve the basic binary operations (including the creati
BTree
- 计算机数据结构：二叉树的前序、中序、后序遍历算法综合版-Computer data structures: binary tree preorder, inorder, postorder traversal algorithm for Science
binarytreedepth
- 求二叉树的深度、前中后序遍历的非递归算法-Seeking depth of binary tree, before, during and after traversing a non-recursive algorithm
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
- 进行一些二叉树的基本操作：1) 前序遍历：将二叉树按前序遍历输出； 2) 中序遍历：将二叉树按前序遍历输出； 3) 后序遍历：将二叉树按前序遍历输出； 4) 层序遍历：将二叉树按前序遍历输出； 5) 求高度：求出二叉树的高度； 6) 求最大宽度：求出二叉树的最大宽度； 7) 判断是否满二叉树： 判断所输入的二叉树是否满二叉树； -Some binary basic steps: 1) pre-order traversal: preorder output binar
二叉树遍历
- 简单的二叉树遍历，中序遍历，后序遍历，前序遍历(Simple two tree traversal)
Tree
- 创建二叉树，前序中序后序遍历二叉树，计算叶子结点树以及树的深度。(The two forked tree is created, and the two forked tree is traversed in the preorder of the preorder, and the leaf node tree and the depth of the tree are calculated.)
tranfer
- 二叉树的各类历遍算法的转换，包括前序，中序与后序。(binary tree transfer for students majoring in instruments.)