Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2002 | Question 37
  • Difficulty Level : Hard
  • Last Updated : 30 Nov, 2014

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: (D)

Explanation:

anil_ds_37

See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-13/

This solution is contributed by Anil Saikrishna Devarasetty

Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :