Location:
Search - Btree.h
Search list
Description: 数据结构BTree.h头文件，包含Visit，IsEmpty，Root，PreOrder，InOrder，PostOrder-BTree.h data structure header files, including Visit, IsEmpty, Root, PreOrder, InOrder, PostOrder
Platform: |
Size: 2048 |
Author: 杨穆智 |
Hits:
Description: 数据结构BTree.h头文件，包含Visit，IsEmpty，Root，PreOrder，InOrder，PostOrder,BTree.h data structure header files, including Visit, IsEmpty, Root, PreOrder, InOrder, PostOrder-BTree.h data structure header files, including Visit, IsEmpty, Root, PreOrder, InOrder, PostOrder, BTree.h data structure header files, including Visit, IsEmpty, Root, PreOrder, InOrder, PostOrder
Platform: |
Size: 2048 |
Author: 杨穆智 |
Hits:
Description: 中序遍历递归与非递归，很简单的代码，就是这么简单！-#include "stdio.h"
#include"stdlib.h"
#define MAXSIZE 20
typedef int datatype
typedef struct Node
{
datatype data
struct Node*lchild
struct Node*rchild
}Btnode,*Btree
typedef struct
{
Btnode*s[MAXSIZE]
int top
}sqstack
Platform: |
Size: 1024 |
Author: 赵王 |
Hits:
Description: 中序递归与非递归，很简单的代码，请放心下载，无毒。-#include "stdio.h"
#include"stdlib.h"
#define MAXSIZE 20
typedef int datatype
typedef struct Node
{
datatype data
struct Node*lchild
struct Node*rchild
}Btnode,*Btree
typedef struct
{
Platform: |
Size: 2048 |
Author: 赵王 |
Hits:
Description: B树的C++实现代码,实现了插入，删除，查找的功能，在VS2008和GCC下通过编译。
B树的实现代码在Btree.h里，TestBtree.cpp是一个非常简单的测试-Implementation code of the Btree
Platform: |
Size: 1809408 |
Author: shuho |
Hits:
Description: 二叉树的建立演示，可以将你输入的数字建立完全的二叉树-#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* l = new BTree
l->data = number
l->left = 0
l->right = 0
return l
}//end CreateLeaf
void append(BTree** root, int number)
{
if (!root) return
BTree* t =*root
if (!t) {
*root = CreateLeaf(number)
return
}//end if
while(t) {
if(number == t->data ) return //ignore duplicated elements.
if(number < t->data ) {
if(!t->left ) {
t->left = CreateLeaf(number)
return
}//end if
t = t->left
}else{
if(!t->right ) {
t->right = CreateLeaf(number)
return
}//end if
t = t->right
}//end if
}//end while
}//end append
void PrintLeaf(const BTree* root)
{
if (!root) return
if (root->left ) PrintLeaf(root->left )
printf(" d\t", root->data)
if (root->right ) PrintLeaf(root->right )
Platform: |
Size: 1174528 |
Author: 陈龙 |
Hits:
Description: B+树、b-树的代码实现，采用了C/C++来写
# 文件说明：
1.Tree.h：B树和B+树的通用接口，虚基类。BTree和BPlusTree都继承它，只有BPlusTree才有linear函数
2.BTree.h,BTree.cpp：B树的声明、实现代码
3.BPlusTree.h,BPlusTree.cpp：B+树的声明、实现代码，注：大多数的函数，B和B+都是一样的，但是我还是分开写了，比如输出函数
4.Context.h：策略方法的实现
5.mian.cpp：使用用例,因为我测试的时候windows和linux都有，为使中文不乱码，我在main写的简单的英语说明(code of B+ tree & B- tree)
Platform: |
Size: 11264 |
Author: fcs
|
Hits: