A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left subtree is at least half and at most twice the number of nodes in the right subtree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) of such a tree on n nodes is best described by which of the following?
a. log2 n
b. log4/3 n
c. log3 n
d. log3/2 n
Answer:log3/2 n
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: