int main()
{
int vals[] = { 5, 3, 7, 1, 4, 6, 9, 0, 2, 8, 10 };
vector<int> values;
for (int i = 0; i < (sizeof(vals) / sizeof(vals[0])); i++) {
values.push_back(vals[i]);
}
BsTree tree;
tree.insert(values);
cout << "Inorder tree traversal:" << endl;
cout << tree << endl;
pause();
cout << "Inorder tree traversal, using NodeActionAccumulator:" << endl;
NodeActionAccumulator naa;
tree.inorderTraversal(naa);
pause();
cout << "Traversal of list created by NodeActionAccumulator:" << endl << " ";
DlList& list = naa.getList();
cout << list << endl;
pause();
cout << "Traversal of previous list, reversed:" << endl << " ";
list.reverse();
cout << list << endl;
cout << endl;
pause("Press enter to exit: ");
}
int main()
{
BsTree<int> tree;
int t[]={5,9,1,0,4,8,7,3,2,6};
for(int i = 0;i<10;i++)
tree.insert(t[i]);
tree.visitInOrder(display);
cout<<endl;
tree.erase(0);
tree.visitInOrder(display);
cout<<endl;
tree.erase(5);
tree.visitInOrder(display);
cout<<endl;
tree.erase(4);
tree.visitInOrder(display);
return 0;
}
