Suppose you have a binary search tree T, sorting numbers in the range from 1 to 500, and you do a search for the integer 250. Which of the following sequences are possible sequences of numbers that are encountered in the search?
a) (2, 276, 264, 270, 250)
b) (100, 285, 156, 204, 275, 250)
c) (475, 360, 248, 225, 251, 250)
d) (450, 262, 398, 239, 270, 250)
e) (255, 294, 260, 133, 250)
**Answer**: b by making sure BT properties are satisfied, which is clear. Is this the fastest way to do it please?