bminustree.h

b-树的增加,删除,已对八百万个数据进行过测试,而且是对多个M值

#ifndef BMINUSTREE_H
#define BMINUSTREE_H

#include "bMinusTreeNode.h"

template<typename X>
class CBMinusTree
{
private:
	CBMinusTreeNode<X> *head;
	int height;
public:
	CBMinusTree(){head=0;}
	void Insert(X);
	CBMinusTreeNode<X>* Find(X,bool &flag);
	void Traverse(CBMinusTreeNode<X> *);
	CBMinusTreeNode<X>* GetHead(){return head;}
	int InsertKey(CBMinusTreeNode<X>*,X);
	X Split(CBMinusTreeNode<X>*,CBMinusTreeNode<X>*);
	void Del(X);
	CBMinusTreeNode<X>* Merge(CBMinusTreeNode<X>*,const int);
	void DeleteKeyInLeaf(CBMinusTreeNode<X>*,const int);
	int IsBMinusTree(CBMinusTreeNode<X>*,int);
	void SetHeight(int h){height=h;}
};

#endif