Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * [BSTree.cpp]
- * Binary search tree example.
- *
- * compile with:
- * g++ -m32 -static-libgcc -o bstree BSTree.cpp
- */
- #include "BinarySearchTree.h"
- int main(void)
- {
- /**
- * Binary Search Tree OBJECT CREATION:
- */
- BinarySearchTree<int> *BSTree = new BinarySearchTree<int>();
- /**
- * Binary Search Tree ITEM INSERTION:
- */
- BSTree->InsertItem(8);
- BSTree->InsertItem(5);
- BSTree->InsertItem(9);
- BSTree->InsertItem(7);
- /**
- * Binary Search Tree ITEM(s) OUTPUT:
- */
- BSTree->PrintTree();
- std::cout << std::endl;
- /**
- * Binary Search Tree ITEM DELETION:
- */
- BSTree->DeleteItem(5);
- /**
- * Binary Search Tree ITEM(s) OUTPUT:
- */
- BSTree->PrintTree();
- std::cout << std::endl;
- /**
- * Binary Search Tree RESET:
- */
- BSTree->ResetTree(POST_ORDER);
- /**
- * Binary Search Tree ITEM(s) OUTPUT:
- */
- BSTree->PrintTree();
- std::cout << std::endl;
- /**
- * Binary Search Tree ITEM(s) RETRIEVAL/OUTPUT:
- */
- int item;
- bool finished;
- BSTree->GetNextItem(item, POST_ORDER, finished);
- std::cout << item << std::endl;
- BSTree->GetNextItem(item, POST_ORDER, finished);
- std::cout << item << std::endl;
- BSTree->GetNextItem(item, POST_ORDER, finished);
- std::cout << item << std::endl << std::endl;
- /**
- * Binary Search Tree ITEM DELETION:
- */
- BSTree->DeleteItem(8);
- /**
- * Binary Search Tree ITEM(s) OUTPUT:
- */
- BSTree->PrintTree();
- std::cout << std::endl;
- /**
- * Binary Search Tree OBJECT DELETION:
- */
- delete BSTree;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement