A weight-balanced tree is a binary tree in which for each node, the number of…

PYQ GATE 2002

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?

  1. A.

    log₂ n

  2. B.

    log_{4/3} n

  3. C.

    log₃ n

  4. D.

    log_{3/2} n

Attempted by 294 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…