Binary search comparison 1

Computer Science Level pending

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?

×

Problem Loading...

Note Loading...

Set Loading...