LawMint Sign in

A binary tree is called perfectly balanced, if each node has a left and a right subtree in which the number of nodes differ by at most

A binary tree is called perfectly balanced, if each node has a left and a right subtree in which the number of nodes differ by at most
  1. 3
  2. 2
  3. 1
    (correct answer)
  4. 0

Answer and explanation

Correct answer: C - 1
A perfectly balanced tree (Wirth's definition) is one where, for each node, the numbers of nodes in the left and right subtrees differ by at most 1.

Practice for these exams

  • CUSAT CAT M.Sc. Forensic Science

  • Uttarakhand Judicial Services