BST implementation to store string using c language
- Add an item (asks user for item)
- Find an item (asks user for item)
- Show two stats for our current tree: number of nodes and maximum depth
- Display tree after asking user to choose from pre, inorder or post order traversal
- Destroy the tree
- Destroy the tree and exit