C++
Instantiate a binary search tree object and create such tree
using elements of the sequence 8,3,10, 1,6,9, 14, 4,7, 13 with 8 as
root of the tree. Find maximum and minimum elements of the tree,
successor(10) and predecessor(13), print the inorder, postorder and
preorder traversal of the tree.