Question

1. a) Design a binary tree with the following traversals?
In-order: DBH EAI FJ C G how to solve​

Answer 1

Answer:

We Look for the smallest value in the selection since we have Inorder traversal

Explanation:Firstly we scan the entire order and find the lowest alphabet

in this case we have 'A' So we select it and devide the order in left and right subtree and continue to find the lowest alphabet

                  A

[DBHE]           [IFJCG]

    B                       C

D     [HE]        [IFJ]     G

             E           F  

        H             I     J