Home/ Questions/Q 6234485
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-24T10:29:39+00:00

I read in a book named Coding Interview Cracked, that to check whether a

  • 0

I read in a book named “Coding Interview Cracked”, that to check whether a BST is balanced or not, just find out the difference between the maximum and minimum height but I not sure whether it is 100% correct. Though I am unable to find a counter test case.

Can anyone confirm whether this approach is correct or not.

For checking whether a tree is balanced or not.

|MaxHieght(root) - MinHieght(root)| <=1
   return true
else return false
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Given the definition of balanced (from the Wiki of Pedias)

    The balance factor of a node is the height of its left subtree minus
    the height of its right subtree (sometimes opposite) and a node with
    balance factor 1, 0, or −1 is considered balanced. A node with any
    other balance factor is considered unbalanced and requires rebalancing
    the tree. The balance factor is either stored directly at each node or
    computed from the heights of the subtrees.

    This seems correct. Since the minHeight and maxHeight are going to be equal to the height of either side, looks like the definition holds

    • 0