1 approach for your interview (hindi)
\nvar isBalanced = function(root) {\n    \n    if(!root) return true\n    \n    let leftHeight  = height(root.left)            // is waaale node ka, left aur ri
```\nvar isBalanced = function(root) {\n    \n    if(!root) return true\n    \n    let leftHeight  = height(root.left)            // is waaale node ka, left aur right subtree ka height kya hai\n    let rightHeight = height(root.right)          \n    \n    \n    \n    if(Math.abs(rightHeight - leftHeight) <= 1     //  (height <= 1) hua toh koi dikkat nai \n      && isBalanced(root.left)                     //  LIKEWISE,  LEFT WALO KE LIYE DEKHO\n      && isBalanced(root.right)                    //  LIKEWISE, RIGHT WALO KE LIYE DEKHO\n    ) return true\n    \n    else return false\n\n};\n\nfunction height(root){\n    if(!root) return 0\n    return Math.max(height(root.left), height(root.right)) + 1\n}\n\n```
['Recursion', 'C', 'Python', 'C++', 'Java']