With each comparison, a binary search eliminates approximately half of the items remaining in the search pool. A. True B. False

If there are more items in a search pool, then it will typically require more comparisons to find an item. A. True B. False

What is the maximum number of comparisons necessary when performing a binary search of100,000 items?a) 13b) 14c) 15d) 16# e) 17

In a strict binary tree a node can have 0 children.Correct answer  True You Answered  False

TRUE or FALSE: The "BGE Method" eliminates the need for doing headchecks (aka over-the-shoulder checks) before changing lanes.

In binary search, average number of comparison required for searching an element in a list if nnumbers is# (A) n log2 .(B) 2/n .(C) n.(D) n – 1.(E)n/2