搜索资源列表
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
t(OK)
- 该程序实现了图的先序、后序遍历和拓扑排序等，而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
bitree5
- 数据结构二叉数结点的各种运算，求左右结点，前后中序遍历各结点-data structure two forks few nodes in a variety of computing and seek around nodes, which preorder before and after each node, etc
erchashubianlisuanfa
- 遍历二叉树的非递归算法，其中有先序遍历，中序遍历和后序遍历。-traversal of a binary tree non - recursive algorithm, which preorder, preorder and after preorder.
VBdotNet_Tree
- 应用VB.net中TreeView控件，实现建立二叉树，并对其前、中、后序遍历-Application Programs require TreeView control, for the establishment of binary tree, and its ago, After the preorder
genBST
- 通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
中序遍历程序
- 一个C++的中序遍历程序，输入一组数据后能中序遍历并升序输出。-one C and the preorder procedures, a data input after which preorder and ascending output.
先序非递归遍历
- 用非递归的方法先序遍历二叉树-non - recursive method preorder Binary Tree
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
vcddd
- 都是以前随手编写的笑程序:总的来说只有五个<回文游戏,层次遍历二叉树,猴子选大王,先序、中序、后序遍历的递归算法等等> 如果对你又帮助你就下来看看吧-are readily prepared by the previous laugh : Overall only five lt; Palindrome games, the level traverse binary tree, monkey king election, the first sequence, sequence,
建立二叉树
- 同济大学课程设计中的一道题! 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数.-Tongji University in curriculum design, the one that! Tree request to enter the various nodes, and can output using different methods traverse the traversal se
tree
- 树的相关操作，建立、中序、前序和后序的递归运算-Operations, the establishment of the tree, inorder, preorder and postorder recursive algorithm
tree
- 二叉树的创建和二叉树的遍历，先序，中序，后序等遍历的实现。-Binary tree creation and traversal of the binary tree, preorder, inorder, and postorder traversal.
BiTree
- 创建一颗二叉树，并且可以用前序、中序、后序进行遍历。-Create a binary tree, and you can preorder, inorder, and postorder traversal.
trees-DLR-and-LDR
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。 -Let binary tree node value of capital letters input binary tree preorder traversal and inorder traversal sequences, this binary tree is gene
BStreeLJH
- MFC实现二叉搜索树，输出先序，中序和后序遍历结果。-MFC binary search tree, output preorder, inorder and postorder traversal results.
Creat_Tree
- 树的创建和遍历，包含前序遍历，中序遍历和后序遍历，并找出某个以前的所有祖先-The creation of a tree and ergodic, including preorder traversal, the sequence traversal and the sequence traversal, and find out a previous all ancestors