Question: A binary search tree ( BST ) stores values in the range 3 7 to 5 7 3 . consider the following sequence of keys

A binary search tree (BST) stores values in the range 37 to 573.consider the following sequence of keys
81,537,102,439,285,376,305
52,97,121,195,242,381,472
142,248,520,386,345,270,307
550,149,507,395,463,402,270
Which of the following statements is true?
Group of answer choices
I, II and IV are in-order sequences of three different BSTs
I is a pre-order sequence of some BST with 439 as the root
II is an in-order sequence of some BST where 121 is the root and 52 is a leaf
IV is a post-order sequence of some BST with 149 as the root.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!