A balanced binary tree with m elements will have height ______________ . A. 2m B. 2m C. logm 2 D. none of the above E. log2 m

A balanced binary tree with m elements will have height ______________ . A. 2m B. 2m C. logm 2 D. none of the above E. log2 m

In a height-balanced tree, what is the minimum height of a leaf node?a)It depends on the number of elements in the tree.b)1c)-1d)0

The maximum and minimum number of nodes in a binary tree of height 6 are :Note: A tree with zero node has height 0.A tree with one node has height 1.

What would be the minimum possible height of the binary search tree with elements [2, 5, 6, 4, 8, 3, 9]  if you are allowed to insert in any order?

A _______________ search is more efficient than a linear search. A. bubble B. insertion C. none of the above D. selection E. binary