本文整理汇总了C++中AvlTree::top方法的典型用法代码示例。如果您正苦于以下问题：C++ AvlTree::top方法的具体用法？C++ AvlTree::top怎么用？C++ AvlTree::top使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类AvlTree的用法示例。
在下文中一共展示了AvlTree::top方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(){
//Define some data
int data[]={21,13,29,8,18,26,32,5,11,16};
int data2[]={55,56,57};
//Define a new AVL tree
AvlTree<int> tree;
//Insert data with loop
for(int i=0;i<10;i++)
tree.insert(data[i]);
//Insert data with built-in loop
tree.insert(data2,3);
//Print a representation of the tree
tree.qtreePrint(cout);
cout<<endl<<endl;
//Remove some nodes
tree.remove(13);
tree.remove(26);
//Print another representation of the tree
tree.qtreePrint(cout);
//Print the number of nodes in the tree
cout<<endl<<endl<<"Size: "<<tree.size()<<endl;
cout<<"Value of top node: "<<tree.top()<<endl;
tree.pop();
cout<<"Value of top node: "<<tree.top()<<endl;
return 0;
}