搜索资源列表
BinTree
- data structures and algorithms
BinTree
- 这是一个二叉树前序遍历后序遍历中序遍历的源代码程序-This is a pre-order traversal binary tree in preorder traversal after traversal of the source code program
BinTree
- C++ 实现简单的二叉树,以及实现前序、中序。后序遍历-c++ implements sample binaryTree
Bintree
- 二叉树，数据结构，实现查找任意两个结点的共同祖先-Binary Tree,Data Structure to achieve Find the common ancestor of any two nodes
BinTree
- 关于数据结构课本中二叉树的建立和前序遍历、中序遍历和后序遍历以及层次遍历-Data structure on the textbooks in the binary tree establishment and traversal, preorder and postorder traversal and hierarchy traversal
bintree
- 构造二叉树，对二叉树进行先序，中序，后序等三个遍历，自己先构造一颗二叉树，然后再进行输入。-Construct a binary tree, binary tree traversal of the first sequence, order, order three, first construct a binary tree, and then enter.
BinTree
- 二叉树代码实现，VC++开发平台，C语言描述的数据结构。-Binary tree code implementation, VC++ development platform, the C language to describe the data structure.
bintree
- binary tree source code
bintree
- 二叉树的遍历，非递归方法，数据结构知识，实验报告！-Binary tree traversal non-recursive method, data structure knowledge, experimental reports!
binTree-hfut
- 合肥工业大学数据结构试验三二叉树（包括实验要求、预习报告、最终试验报告）。 主要实验内容： <1>求二叉树的高度。 <2>设计算法按中序次序输出二叉树中各结点的值及其所对应的层次数。 <3>将按顺序方式存储在数组中的二叉树转换为二叉链表形式。 <4>复制一棵二叉树T到T1。 <5>交换二叉树中每个结点的左右孩子指针的值。 <6>设计算法以实现下面所提到以扩
BinTree
- BST的平衡查找树 C ++实现所需的高效率平衡查找树-BST balanced Find tree C++ to achieve the required high efficiency balanced search tree
BINtree
- 实现二叉树前序、中序和后序遍历以及建立的递归算法-Achieve binary tree preamble, inorder and postorder traversal and the establishment of a recursive algorithm
bintree
- 关于二叉树的插入，先序遍历，后序遍历，中序遍历，叶子节点个数，树的深度，路径查找。-Binary tree insertion, preorder, postorder traversal, preorder, the number of leaf nodes, the depth of the tree, the path to find.
BinTree
- 以二叉树表为存储结构，实现二叉树的先、中、后三种次序的递归和非递归遍历。-Table stored in a binary tree structure to achieve binary tree before, during and after the three kinds of order recursive and non-recursive traversal.
BinTree
- 二叉树的实现与应用，语言：C/C++， 平台：WINDOWS-implementation of binary tree, language : c/c++, platform: windows
BinTree
- 实现二叉树的一些功能，如建立二叉树，查找，-Achieve binary tree features, such as creating a binary tree, find,
BinTree
- 二叉排序树，实现树的各种操作，包括计算深度，找最大值最小值，还有各种遍历的递归算法和非递归算法，以及查找查找树的前驱节点和后继节点-Binary sort tree, the tree to achieve various operations, including the calculation of depth, looking for maximum minimum, there are various recursive traversal algorithm and non-recur
BinTree
- 二叉树的编写，知道先序和中序二叉树，求出对应的后序二叉树-Preparation of a binary tree, and know the preorder and levelorder binary tree, in order to find the postorder binary tree。
bintree
- 二叉查找树的建立查找插入删除，有详细的源代码-Build a binary search tree to find insertion and deletion, a detailed source code
bintree
- 实现二叉树的前序创建实现二叉树的计算节点个数等功能-creat er cha shu