dup.h

data struct algorithm and application in c++ 一书的课后答案源码

while (p) {
   q = p;
   if (e <= p->data) p = p->LeftChild;
   else p = p->RightChild;
   }