/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null){
return true;
}
if( root.right == null && root.left != null && (root.left.left != null || root.left.right != null) ){
return false;
}
if(root.left == null && root.right != null && (root.right.right != null || root.right.left != null))
{
return false;
}
return isBalanced(root.left) && isBalanced(root.right);
}
}
Input: | {1,2,2,3,3,#,#,4,4} |
Output: | true |
Expected: | false |