79. Given a binary search tree where its node numbers are in [1,1000], now we want to
search the number 363. Which one of the following searching orders is impossible?
(A) 925, 202, 911, 240, 912, 245, 363
(B) 2, 252, 401, 398, 330, 344, 397, 363
(C) 924, 220, 911, 244, 898, 258, 362, 363
(D) 2, 399, 387, 219, 266, 382, 381, 278, 363