Create an abstract class Binary_Treehaving three traversal functions(preorder, inorder, postorder) andanother function to calculate theheight of the binary tree. Derive aclass BST (Binary search tree)...

Create an abstract class Binary_Treehaving three traversal functions(preorder, inorder, postorder) andanother function to calculate theheight of the binary tree. Derive aclass BST (Binary search tree) fromBinary_tree having a suitable insertand delete functions. Derive anotherclass AVL Tree from BST which must bebalanced.