adplus-dvertising
frame-decoration

Question

How does a binary search work in a tree structure?

a.

By eliminating one-half of the list with each iteration

b.

By randomly selecting items to search

c.

By sequentially searching for each item

d.

By sorting items based on their index number

Posted under Reverse Engineering

Answer: (a).By eliminating one-half of the list with each iteration Explanation:A binary search in a tree structure works by eliminating one-half of the list with each iteration.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How does a binary search work in a tree structure?