Question: A balanced binary tree contains 1 2 0 elements . what is the maximum number of comparison necessary to find an element in the tree?

A balanced binary tree contains 120 elements . what is the maximum number of comparison necessary to find an element in the tree?
Select one
a.60
b.12
c.7
d.1

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!