Write the inorder, preorder and postorder traversals of the following binary search tree.

 A
    /
  B   H
  /    /

 C E I

/ F  

D /    J

   G

In this binary tree, each node has at most two children. The node "A" is the root node of the tree. Node "B" is a child of node _____ ____ _____ _________ _______ ___ __________ ______.
______ ______ _____ _____ ____ ________ _________ ____ ____ ___.
___ ________ _________ _______ _____ ______ ______ ___ ___ ____ __________ ________.
___ ______ _____ ____ _________ _____ ________ _______ _____ ___ ___ ________.
______ ____ _____ ___ __________ _________ ____ ___ ______ _______ _______.
______ ______ ______ _______ _____ __________.
_______ ____ _____ ____ ________ _________ ____ ___ _________ ___ ________ ___.
______ ___ ____ ____ __________.
________ ___ _________ _______ ___ ___ ______ ______ ___.
__________ _______ ______ __________ ________ ______ ________ _________ ___ ___ __________.
______ ________ _________ __________ ____ ___ ______ _________ __________.
_________ ___ _________ __________ _____ _____ ____ ________ ________ _____ __________.
_______ __________ _________ ___ ______.
______ __________ ______ ___ ______ ______ ___ ___ ________ _____.
____ _____ __________ _________ __________.
__________ ____ ______ _______ __________.
Get Full Answer on WhatsApp