Question

Implement the BST as a threaded binary tree. Insert the following elements into the tree : T. B. E. A. H. F. D. R. I. O. L. Print the elements in the tree in the (L-R) and (R-L) In-order traversal scheme .