void BTree::print() { BTreeNode *BTreeNodePtr; Queue<BTreeNode*> queue(1000); queue.enqueue(root); while(!queue.isEmpty()) { BTreeNodePtr = queue.dequeue(); BTreeNodePtr->print(queue); } // while } // BTree::print()