Traverse a tree in the Inorder and find sorted listing of elements - Binary search tree

Q.  If you traverse a tree in the Inorder and find sorted listing of elements then it is a
- Published on 22 Jun 15

a. Binary search tree
b. Binary tree
c. Heap
d. None of the above.

ANSWER: Binary search tree

Related Content

 

    Discussion

  • Nihal   -Posted on 01 Apr 16
    If you traverse a tree in the Inorder and find sorted listing of elements then it is called as Binary Search Tree (BST).
    BST
    In order traversal of given BST is 1, 5, 6, 7, 8, 9, 10, 12, 13, 15, 20

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲