Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2002 | Question 37

  • Difficulty Level : Hard
  • Last Updated : 28 Jun, 2021
Geek Week

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :