本文整理汇总了C++中BST::displayMax方法的典型用法代码示例。如果您正苦于以下问题：C++ BST::displayMax方法的具体用法？C++ BST::displayMax怎么用？C++ BST::displayMax使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BST的用法示例。
在下文中一共展示了BST::displayMax方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(){
BST tree;
//test 1
tree.insert(5,"ahmed");
tree.insert(7,"daramally");
tree.inOrder();
cout << "Current H :" << tree.getMaxHeight() << "\n";
cout << "\ntest 1 is successful!\n\n";
//test 2
tree.insert(1,"omar");
tree.inOrder();
cout << "Current H :" << tree.getMaxHeight() << "\n";
cout << "\ntest 2 is successful!\n\n";
//test 3
tree.set(7,"non-daramally");
cout << "Current H :" << tree.getMaxHeight() << "\n";
tree.inOrder();
cout << "\ntest 3 is successful!\n\n";
//test 4
tree.insert(2,"mostafa");
tree.insert(3,"todo");
tree.inOrder();
cout << "Current H :" << tree.getMaxHeight() << "\n";
cout << "\ntest 4 is successful!\n\n";
//test 5
tree.modify(3,"darsh");
cout << "Value after edit : " << tree.lookUp(3) << "\n";
tree.inOrder();
cout << "\ntest 5 is successful!\n\n";
//test 6
cout << "before delete\nContains key? : " << tree.containsKey(3) << "\n";
tree.deleteNode(3);
cout << "after delete\nContains key? : " << tree.containsKey(3) << "\n";
tree.inOrder();
cout << "Current H :" << tree.getMaxHeight() << "\n";
cout << "\ntest 6 is successful!\n\n";
//test 7
cout << "Num of Nodes : " << tree.countNodes() << "\n";
tree.displayMin();
tree.displayMax();
puts("");
tree.preOrder();
puts("");
tree.postOrder();
cout << "\ntest 7 is successful!\n\n";
}