Approach:

Base Case: If the root is null, it indicates an empty tree, which is considered balanced. So, return true.
Use a helper function like getHeight to recursively calculate the height of the left and right subtrees.
Store the height of the left subtree in a variable and the right subtree in another variable.
Check if the absolute difference between the two heights is less than or equal to 1.
If this condition holds, recursively call the isBalanced function on the left and right child nodes.
If both subtrees are balanced and the current node also satisfies the height condition, return true.
If the height difference is more than 1 or any subtree is unbalanced, return false.