Author: Nick House Project: Tree Traversals Course: CS-3130 Algorithms Date: 18Nov2019
Tree Traversals, Insertion, Removal and Depth (In - Post - Pre)
This Project is basic BST Manipulation of a pre populated Binary Tree
When the project is run the user has the option of:
- Display traversals of Binary Search Tree. (In-order, Post-Order and Pre-Order)
- Show the Height of the Binary Search Tree.
- Show result and sequence of Tree-Search (Call Key 38 and 9)
- Delete key 10 then Display (In-Order, Post-Order and Pre-Order)
- Insert new Keys to BST
- Reset to Original BST
- Delete Key of choice
- Exit Program