Suppose we have integer key values between 1 and 1000 stored in a binary search tree and we want to search for the key value 363. For each of the following sequences, indicate whether or not it can be a valid sequence of nodes examined during the search. If the sequence is valid, draw the search path clearly indicating whether a node is the left child or the right child of its parent. If the sequence is invalid, explain why it cannot arise in the search. a) [12.5 pts] 2, 399, 387, 219, 266, 382, 381, 278, 363. b) (12.5 pts 935, 278, 347, 621, 299, 392, 358, 363. Show transcribed image text Suppose we have integer key values between 1 and 1000 stored in a binary search tree and we want to search for the key value 363. For each of the following sequences, indicate whether or not it can be a valid sequence of nodes examined during the search. If the sequence is valid, draw the search path clearly indicating whether a node is the left child or the right child of its parent. If the sequence is invalid, explain why it cannot arise in the search. a) [12.5 pts] 2, 399, 387, 219, 266, 382, 381, 278, 363. b) (12.5 pts 935, 278, 347, 621, 299, 392, 358, 363.

## Expert Answer

Answer to Suppose we have integer key values between 1 and 1000 stored in a binary search tree and we want to search for the key v…