Insert, delete, search and traverse a BST visually.
O(log n)
Search
Insert
Delete
BST initialized: 50, 30, 70, 20, 40, 60, 80
