Q27,paper2,June 12. The Inorder traversal of the tree will yield a sorted listing of elements of tree in

Options (A) Binary tree    (B) Binary search tree     (C) Heaps

(D) None of the above

Answer (B) BST

Explanation. Lets take BST.

Inorder traversal is  left sub tree, Root and right sub tree. Then

-4,2,3,5,18,19,21,25. Hence it is sorted.