1 6 co 3 16 4 7 19 1 13 8 9 10 11 12 VI. Assume we're given an arbitrary BST containing the same values as the BST abo
Posted: Fri May 20, 2022 5:43 pm
- 1 6 Co 3 16 4 7 19 1 13 8 9 10 11 12 Vi Assume We Re Given An Arbitrary Bst Containing The Same Values As The Bst Abo 1 (14.33 KiB) Viewed 30 times
- 1 6 Co 3 16 4 7 19 1 13 8 9 10 11 12 Vi Assume We Re Given An Arbitrary Bst Containing The Same Values As The Bst Abo 2 (38.77 KiB) Viewed 30 times
VI. Assume we're given an arbitrary BST containing the same values as the BST above and a number x (which may or may not be in the BST). What is the smallest number k such that we can guarantee that searching for x in the given BST would make at most k calls to TREE- SEARCH?