Is balanced one testcase failing

#1

what iam doing wrong ??

#2

hi ajay
can you please explain your logic behind the line written in main which relates to maximum and minimum
how it will be able to find if the tree is balanced or not

#3

i got your point ,this is a wrong approach. so what should be the logic for this ???

#4

The question says to find out whether a given binary tree is balanced or not. A non-empty binary tree T is balanced if:

  1. Left subtree of T is balanced
  2. Right subtree of T is balanced
  3. The difference between heights of left subtree and right subtree is not more than 1.
    Also, an empty tree is balanced.
    algorithm:
    Get the height of left and right subtrees.
    Return true if difference between heights is not more than 1 and left and right subtrees are balanced, otherwise return false.
1 Like
#5

thank u so much ma’am .