GO Classes 2023 | IIITH Mock Test 1 | Question: 31

Answer 1

Let’s take options

Method 1 :   if we are at any node x then ,by moving  in left sub tree we are fixing upper bound as x and by moving right sub tree we are fixing lower bound as x

For option A   

1. 925 will be inserted then for 363 we have to move left sub tree so next value should be less than 925 so 202 get inserted
2. 925,202 then 363 > 202 to move right sub tree value next value must be in [202,925] ,so 911 get inserted
3. 925,202,911  then 363 < 911 we have to move left sub tree so next value must in [202,911] that is 240 get inserted
4. 924,202,911,240 then 363 > 240 move to right sub tree so next value must be b/w [240,911] but next value is 912 so fail 

So A is correct

 

Method 2 :

In this method take a sequence and draw BST for the sequence if the resultant BST is Degenerate tree the sequence is correct otherwise not correct 

In method 2 till now I have never find any limitations but I get to know that this method have some limitation