is Balanced

[rishabh3112]

Question

Given a binary tree, check if its balanced i.e. depth of left and right subtrees of every node differ by at max 1. Return true if given binary tree is balanced, false otherwise.

Input format

Elements in level order form (separated by space). 
If any node does not have left or right child, take -1 in its place.

Output format
boolean

[rishabh3112]

Use Pair approch to solve the problem @bhavya9107 and @rishabh3112