搜索资源列表
Btree
- 按层次序依次输入完全二叉数的元素值，以链表方式建立该完全二叉树，并按中序遍历结果输出结点值。-Hierarchical order followed by complete binary input values the number of elements to list the establishment of the complete binary tree method, according to the results in traversing the value of output
BTree
- 二叉树编程，完整实现，包括树的增加，删减等维护功能-Binary programming, a complete implementation
BTree3_src_vc6
- VC++上开发的基于STL的Btree的一个程序，是学习算法的一个好例子-Good example on BTree based on STL in VC++
btreechat
- THis btree chatting application developed for sending msg to all the child nodes of the message sendre-THis is btree chatting application developed for sending msg to all the child nodes of the message sendre
BTREE
- B Tree for insertion & deletion using temoplate
btree.tar
- Bplus tree implementation in C.
BTree
- 二叉树的基本操作 建立 求高度 求节点数 以及三种基本遍历-Basic operation of the binary tree nodes attempt to find a high demand and the three basic traversal
btree
- （1）二叉树的创建操作； （2）二叉树的销毁操作； （3）二叉树的先序遍历的递归算法； （4）二叉树的中序遍历的递归算法； （5）二叉树的后序遍历的递归算法； （6）二叉树的先序遍历的非递归算法； （7）二叉树的中序遍历的非递归算法； （8）二叉树的后序遍历的非递归算法； （9）二叉树的层次遍历算法； -(1) the creation of binary operations (2) the destruction of binary
Btree
- 用c++实现b+tree，包含插入删除等函数-Achieved using c++ b+ tree, including insert and delete functions
BTree 二叉树的遍历与应用
- 二叉树的建立，前序中序后序遍历，线索化，递归非递归遍历，查找前驱或后继结点，输出，菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
General-Tree-To-BTree-(CSharp)
- this an application for converting a General Tree to B-tree. -this is an application for converting a General Tree to B-tree.
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
- important c++ program all engineering students can use this for developing the program.
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