LeetCode110-20.8.17-平衡二叉树

题目链接:LeetCod110
分析：一个二叉树是平衡二叉树，当每个节点的左右子树差不超过1。
思路：树的遍历
我的代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root==null)return true;
        if(!isBalanced(root.left)||!isBalanced(root.right))return false;
        return Math.abs(judge(root.left)-judge(root.right))<=1;
    }
    int judge(TreeNode node){
        if(node==null)return 0;
        return Math.max(judge(node.left),judge(node.right))+1;
    }
}