Question: 1. (Basic) Consider the BST in Fig 12..(b). Print out al the keys in the BST in preorder, then postorder 2. (Basic) Suppose that we

1. (Basic) Consider the BST in Fig 12..(b). Print out al the keys in the BST in preorder, then postorder 2. (Basic) 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) 2, 252, 401, 398, 330, 344, 397, 363. (b) 924, 220, 911, 244, 898, 258, 362, 363 (c) 925, 202, 911, 240, 912, 245, 363. (d) 2, 399, 387, 219, 266, 382, 381, 278, 363 e) 935, 278, 347, 621, 299, 392, 358, 363
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
