Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
Answer is D.
Inorder traversal is left node right.
Preorder is node left right.
Try it ..
I have seen this figure on 3 questions. In how many questions same figure.
By this way we can create tree and Check options so option D is answer