btree.h

来自「数据结构与程序设计教材源码 数据结构与程序设计教材源码」· C头文件 代码 · 共 36 行

 
template <class Record, int order>
class B_tree {
public:  //  Add public methods.
 
   B_tree();
   Error_code search_tree(Record &target);
   Error_code insert(const Record &new_node);
   Error_code remove(const Record &target);
   ~B_tree();
   void print();
private:
   void recursive_print(B_node<Record, order> *, int);
   Error_code recursive_search_tree(B_node<Record, order> *, Record &);
   Error_code search_node(B_node<Record, order> *, const Record &, int &);
   Error_code push_down(B_node<Record, order> *, const Record &, Record &,
          B_node<Record, order> *&);
   void push_in(B_node<Record, order> *, const Record &,
             B_node<Record, order> *, int);
   void split_node(B_node<Record, order> *, const Record &extra_entry,
           B_node<Record, order> *, int,
           B_node<Record, order> *&, Record &);
   Error_code recursive_remove(B_node<Record, order> *, const Record &);
   void copy_in_predecessor(B_node<Record, order> *, int);
   void remove_data(B_node<Record, order> *, int);
   void restore(B_node<Record, order> *, int);
   void move_left(B_node<Record, order> *, int);
   void move_right(B_node<Record, order> *, int);
   void combine(B_node<Record, order> *, int);
 
 
private: //  data members
   B_node<Record, order> *root;
         //  Add private auxiliary functions here.
};