本文整理汇总了C++中BST::averagedepth方法的典型用法代码示例。如果您正苦于以下问题：C++ BST::averagedepth方法的具体用法？C++ BST::averagedepth怎么用？C++ BST::averagedepth使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BST的用法示例。
在下文中一共展示了BST::averagedepth方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main()
{
//two ints and a tree
BST tree;
int i;
int time;
cout << "Order Inserted in: \n";
//test loop inserts 12 nodes into the tree
for(time = 0; time < 12; time++)
{
i = rand()%10000;
tree.insert(i);
cout << i << ' ';
}
//This simply tests the outputs for the tree
cout << '\n';
cout << "\nPreorder Output \n";
tree.preorder();
cout << "\n\n";
cout << "Inorder Output \n";
tree.inorder();
cout << "\n\n";
//Tests the classes deleteing capabilites
cout << "Deleting " << i << ": \n";
tree.deleteit(i);
cout << "\nPreorder Output \n";
tree.preorder();
cout << "\n\n";
cout << "Inorder Output \n";
tree.inorder();
cout << "\n\n";
//finishes inserting 488 more nodes to test average depth and
//height
for(time = 12; time < 500; time++)
{
i = (rand()%10000);
tree.insert(i);
}
//outputs the trees height and average depth as asked
cout << "Height is: \n";
cout << tree.height();
cout << '\n';
cout << "\nAverage Depth is: \n";
cout << tree.averagedepth();
cout << "\n\n";
return 0;
}