The document Binary Search Tree (BST) GATE Notes | EduRev is a part of GATE category.

All you need of GATE at this link: GATE

**
A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys.**

Key to be searched 273:

- I) 81, 537, 102, 439, 285, 376, 305 is not correct

We cannot go to 376 from 285 as 273 is smaller than 285. - II) 52, 97, 121, 195, 242, 381, 472 is not correct.

We cannot go to 472 from 381 as 273 is smaller than 381. - III) 142, 248, 520, 386, 345, 270, 307 is correct
- 550, 149, 507, 395, 463, 402, 270 is not correct.

We cannot go to 463 from 395 in search of 273

- Binary Search Trees MCQ - 1
Test | 20 questions | 60 min

- Binary Search Trees MCQ - 2
Test | 20 questions | 60 min

- Test: Spanning Tree
Test | 24 questions | 90 min

- Tree (Basic Level) - 1
Test | 10 questions | 30 min

- Test: Tree Structure
Test | 13 questions | 40 min