本文整理汇总了C++中BinaryTree::inorderTreeWalk方法的典型用法代码示例。如果您正苦于以下问题：C++ BinaryTree::inorderTreeWalk方法的具体用法？C++ BinaryTree::inorderTreeWalk怎么用？C++ BinaryTree::inorderTreeWalk使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTree的用法示例。
在下文中一共展示了BinaryTree::inorderTreeWalk方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: testBinaryTree01
void testBinaryTree01()
{
cout << "Testing Binary Tree basics" << endl;
BinaryTree* myTree = new BinaryTree;
double myArray[10] = {5, 23, 6, 1, 34, 35, 10, 33, 5, 2};
for(unsigned int i = 0; i < sizeof(myArray)/sizeof(double); i++)
{
BinaryTreeNode* myNode = new BinaryTreeNode(myArray[i]);
myTree->treeInsert(myNode);
}
cout << "Finished inserting nodes into tree" << endl;
cout << "Printing the nodes in the tree" << endl;
myTree->inorderTreeWalk(myTree->rootNode);
cout << "Finished printing inorder tree" << endl;
myTree->preorderTreeWalk(myTree->rootNode);
cout << "Finished printing preorder tree" << endl;
myTree->postorderTreeWalk(myTree->rootNode);
cout << "Finished printing preorder tree" << endl;
BinaryTree* temp = myTree;
delete myTree;
cout << "The following should not print" << endl;
myTree->inorderTreeWalk(temp->rootNode);
cout << "Nothing should have printed here" << endl;
}