搜索资源列表
BTree 二叉树的遍历与应用
- 二叉树的建立，前序中序后序遍历，线索化，递归非递归遍历，查找前驱或后继结点，输出，菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
BTree
- haskell code for binary trees
btree
- 该文件描述了如何根据一个已知序列建立二叉树。-build tree.
BTree
- 定义二叉树两个结点的最小距离为这两个结点的最近公共祖先分别到这两个结点的路径长度之和。请设计一种方法，找出给定二叉树中任意两个结点的最小距离，可以考虑以图形显示之。程序实现二叉树的层次遍历，要求每层之间的数据用一个空格分开。二叉树采用二叉链表方式进行存储-Defined binary minimum distance of two nodes for these two nodes were the most recent common ancestor of these two nodes a
btree
- 先序递归创建二叉树，计算二叉树中叶子节点的个数-Create a binary tree recursive first order to calculate the number of leaf nodes in binary tree
btree
- 数据结构，利用c++实现二叉树，代码简单灵活。-Data structure to achieve a binary tree using c++ code simple and flexible.
btree
- 二叉树的遍历、插入、删除以及求二叉树的高度-Binary tree traversal, insert, delete, and find the height of binary tree
stx-btree-0.8.3
- 用b+树算法实现的map,set容器，查找速度超快-map,set container base on B+tree algorithm 。can search faster than the STL container base on RBtree algorithm
Exp21_3
- 编写求二叉树的叶子结点数的函数模板。 [算法] 求一棵二叉树的叶子结点数的递归模型如下。 f(btree)=0 若为空树时 f(btree)=1 若只有根结点时,该根结点是叶结点-Leaves the preparation of the binary tree nodes seek the function template. [Method] request a binary tree leaf nodes of the recursive model is as
btree
- 关于数据结构这门学科的源代码程序，序列七之一-About data structure of the subject, the source program
Btree
- 二叉树的插入删除先后中序遍历及求宽度和深度-Binary tree insertion and deletion has in traversing the width and depth requirements
BTree
- 实现了B树的创建，在此基础上，构建搜索信息，完成了搜索，添加，删除，显示树形等操作-Realized B the creation of a tree, based on this information, the construction of the search, completing the search, add, delete, shows such as tree operation
btree
- 这是个平衡二叉树创建及其遍历的c源程序，希望的大家有点用-This is a balanced binary tree creation and traversal of the c source code, we are a bit of hope with
btree
- 二叉树的实现代码，祝各位好运，请尊重原作者版权-Realization of binary code, I wish you good luck, please respect the original copyright
btree
- 树的基本运算，包括遍历，插入和删除结点，二叉树的存储结构-Tree basic operations, including through, insert and delete nodes, binary storage structure
btree
- B树，是一种很有效率二叉搜索树，利用它可以的旋转功能可以很方便的构造，很快的查找 数据结构-B-tree is a very efficient binary search tree, it can use the rotation function can be constructed easily, quickly find the data structure
btree
- 平衡二叉树模板，能实现在logN内的查找和插入。是当前查找算法中比较有历史和权威的一种算法。-Balanced binary tree template, can be achieved within the logN find and insert. Search algorithm to compare the current and historical authority of an algorithm.
BTree
- 数据结构C语言版_二叉树的三叉链表存储表示，适合初学者，清华版的源码-c sourse for DS
BTree
- 二叉树遍历，可以计算先中后遍历计算，C++的平台。-Binary tree traversal, can be calculated after the first traversal in the calculation, C++ platform.
BTree
- 写的一个测试树结构的一个程序，对于学习数据结构的同学应该有所帮助吧-Write a test tree structure of a program for students learning data structures should help it