A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys.
Which of the following statements is TRUE?
option C says “inorder sequence of some BST”
@Mahima
II is an inorder sequence of some BST where 121 is the root and 52 is a leaf
some BST means there exists a BST with these properties.
those who are saying option C is not correct in all the cases….
II is an inorder sequence of some BST where 121 is the root and 52 is a leaf.
pls justfy........."where 121 is the root and 52 is a leaf"
Answer should be option C
64.3k questions
77.9k answers
244k comments
80.0k users