Binary search comparison 1
You are given a complete binary search with 860 nodes. It is required tofind an element in the tree, but we don't know which element to look for beforehand. What will be the maximum number of comparison (worst case) made to find an element in the tree?
The answer is 10.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!