Assume that we have numbers between 1 and 1000 in a BST and want to search for
Question:
Assume that we have numbers between 1 and 1000 in a BST and want to search for the number 363. Which of the below ordering could not be the ordering of the node reviewed?
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, 258, 363
D. 2, 399, 387, 219, 266, 382, 381, 278, 363
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Data Structures Using C A Practical Approach For Beginners
ISBN: 9781000470741
1st Edition
Authors: Amol M Jagtap, Ajit S Mali
Question Posted: