class BTree

Public Members

• BTree (short order = 2)
• ~BTree ()
• T * Find (const T &item) const
• T * Smallest () const
• T * Largest () const
• T * ItemWithRank (long rank) const
• long RankOf (T item) const
• long Size () const
• bool Add (T item)
• T Remove (T key)
• T ExtractMin ()

Protected Members

• void updSubtree (BTreeNode<T>** stack, int sp)
• enum DeleteActionEnum {NoAction, RotateLeft, RotateRight, Merge}
• bool _InsertNonFull (BTreeNode<T>* x, T item)
• void _SplitChild (BTreeNode<T>* x, short i, BTreeNode<T>*y)
• BTreeNode<T>* _DescendInto (BTreeNode<T>*node, short subtreeIndex, DeleteActionEnum& action)
• BTreeNode<T>* _Adjust (BTreeNode<T>* node, short index, BTreeNode<T>* c0, BTreeNode<T>* c1, DeleteActionEnum& action)
• short _order
• BTreeNode<T> * _root
• BTreeNode<T> * Root () const