bpfind1.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 12 行

class PAIR {
  void* pointer; // Record* for leaves, BPNode* for internal nodes
  KEY key;
}

class BPNode {
  PAIR recarray[MAXREC];
  int numrec;
  BPNode* leftptr, rightptr;  // Each level forms doubly-linked list
  Bool isLeaf();
}