判断平衡二叉树

IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right)

public class Solution {
    public boolean IsBalanced_Solution(TreeNode root) {
           if(root==null){
                return true;
            }
            if(Math.abs(TreeDepath(root.left)-TreeDepath(root.right))>1)
            return false;
            return IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right);

        }
       //求二叉树的深度
        public int TreeDepath(TreeNode pRoot){
            if(pRoot==null)
                return 0;
            if(TreeDepath(pRoot.left)>=TreeDepath(pRoot.right)){
                return 1+TreeDepath(pRoot.left);
            }else{
                return 1+TreeDepath(pRoot.right);
            }
        }
}