搜索资源列表
btree
- 二叉树源码，通过链表实现。有意向者可以-Binary source
BTree
- 用MFC实现二叉树的建立，前序中序后序遍历，求树高，叶子个数，交换左右子树，求结点个数，复制二叉树等-The establishment of a binary tree using MFC, after pre-order ininorder traversal order, seeking tree height, leaf number, exchange left and right subtrees, the number of demand nodes, copy the binar
Btree
- This a C++ code. The task is to construct a B-tree. Given some leaves values, it is required to construct the corresponding tree and assess a range of evaluations for the variables, indicating that the result returned. please find the full descr ipti
Btree
- 程序功能：二叉树的建立 二叉树的初始化 前序遍历二叉树（递归与非递归方法） 中序遍历二叉树（递归与非递归方法） 后序遍历二叉树（递归与非递归方法） 求二叉树高 求二叉树的叶子总数 退出操作的实现-binary tree
BTree
- 二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....
btree
- 大学课程《数据结构》中的实验：二叉树及基本功能 -binary tree and basic functions
Btree
- 可以通过按键演示二叉树的创建、查找节点、删除节点、演示树高等-Through the creation of the key demo binary tree to find nodes, delete nodes, presentation tree higher
1111
- 二叉树的建立演示，可以将你输入的数字建立完全的二叉树-#include <stdio.h> #include <string.h> #include <windows.h> struct BTree { int data struct BTree* left struct BTree* right } //end struct BTree BTree* CreateLeaf(int number) {
BTree
- 按照给定序列建立二叉树，可分别按照先序、中序和后序建立-In accordance with the establishment of a binary tree given sequence, in accordance with the first sequence in the sequence and the order of the establishment
stx-btree-0.8.6.tar
- The STX B+ Tree package is a set of C++ template classes implementing a B+ tree key/data container in main memory. The classes are designed as drop-in replacements of the STL containers set, map, multiset and multimap and follow their interfaces very
Bbtrreeet
- 一种基于btree索引算法的数据据库代码，提供了回滚日志备份等功能 -Data algorithm based btree index database code, provides a rollback log backup function
BTree(C)
- 转换二叉树与广义表(C语言)，有助于大家了解二叉树的定义。-Convert a binary tree with broad table (C language), will help you understand the definition of the binary tree.
bst
- 排序二叉树类简单实现，采用引用类型代码很简洁，但是很巧妙。-btree code
btree
- Program for B Tree implimentation
BTree-Sort
- 使用二叉树进行数的排序，并且有删除和添加一个新的数，并保持有序。-Uses binary tree number of sort and delete, and add a new number, and to maintain orderly.
BTree
- B树的树状打印，插入，删除，修改
BTree
- B-树查找算法的测试，包括查找，拆分，替换，新建，删除等-Test of the B-tree search algorithms, including Find, split, replace, new, delete, etc.
BTree
- b+树的各种功能，包括创建，插入，删除，添加节点等-tree function b+ including create, insert, delete, add nodes
btree
- 建立一棵树，用多种方法遍历，前序 后序 中序 -Traversing Binary Tree
btree
- 从空树开始，依次输入各关键字，建立相应的B树。并实现B树中关键字的插入及删除 -Starting with an empty tree, enter each keyword in turn, establish the corresponding B-tree. And insert and delete keywords in the B-tree