本文整理汇总了C++中AVL::root方法的典型用法代码示例。如果您正苦于以下问题:C++ AVL::root方法的具体用法?C++ AVL::root怎么用?C++ AVL::root使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类AVL
的用法示例。
在下文中一共展示了AVL::root方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: printTreeStatus
void printTreeStatus(const AVL<T> &t) {
cout << "----------------------------------------" << endl;
if (t.isEmpty()) cout << "The tree is empty" << endl;
else {
cout << "Tree root is: " << t.root() << endl;
cout << "Tree height is: " << t.height() << endl;
cout << "Tree contains " << t.size() << " elements" << endl;
}
cout << "----------------------------------------" << endl;
}
示例2: main
int main()
{
int values[N];
AVL<int> avl;
cout << "Populating the tree with " << N << " random values... ";
for (unsigned i = 0; i < N; ++i) {
values[i] = rand();
avl.insert(values[i]);
}
cout << "Done" << endl;
printTreeStatus(avl);
for (unsigned i = 0; i < N; ++i) {
unsigned idx = rand() % N;
if (!avl.contains(values[idx]))
cout << "ERROR: Value " << values[idx] << " was inserted and not found!" << endl;
}
cout << "Now removing a random element from the tree... ";
unsigned idx = rand() % N;
avl.erase(values[idx]);
cout << "Done" << endl;
printTreeStatus(avl);
cout << "Now removing the root of the tree " << N_ELEMS_TO_REMOVE << " times... ";
for (unsigned i = 0; i < N_ELEMS_TO_REMOVE; ++i) {
avl.erase(avl.root());
}
cout << "Done" << endl;
printTreeStatus(avl);
// Outputting to cerr so the output can be redirected with ./avl_demo 2> <name>.gvz
cout << "Do you want to output the GraphViz representation of the tree to the cerr stream (Y/n)? ";
char usrInput;
cin >> usrInput;
if (usrInput == 'Y' || usrInput == 'y') avl.toGraphViz(cerr, "AVL");
return 0;
}