Please draw binary search tree so that I can understand better.

Suppose that we have numbers between 1 and 1000 in a binary search tree, and we want to search for the number 363. Which of the following sequences could not be the sequence of nodes examined? a. 225, 240, 13, 983, 303, 443, 973, 63 b. 242, 209, 112, 448, 982, 583, 623, 639. c. 252, 29, 112, 409, 122, 453, 639. d. 239, 938, 721, 926, 638, 238, 127, 836, 3 e. 352, 783, 476, 212, 993, 923, 583, 639