搜索资源列表
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
BTree
- b-树的建立插入删除，基本演示，数据结构课设-b-tree creation insertion deletion, basic presentation, set up data structures course
btree
- 标准C++的B树实现，使用类和模板，具有通用和代表性。-A c++ implementation OF b tree, which is generic and representative.
BTree
- 二叉树的四种遍历结果，各结点层序输出，计算各结点总数，找一种遍历结果中第n个结点的双亲结点，孩子结点和第几个位置的结点。-The results of the four binary tree traversal, each node sequence output, calculate the total number of nodes, find a loop through the results of the first n nodes of parent nodes, child no
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