Balanced Binary Tree（Java代碼沒過，什麼原因？？？），balancedbinary

Balanced Binary Tree（Java代碼沒過，什麼原因？？？），balancedbinary

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

/** * Definition for binary tree * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    bool isBalanced(TreeNode *root) {        int depth=0;        return isBalanced(root,&depth);    }    bool isBalanced(TreeNode *root,int* depth){        if(root==NULL){            *depth=0;            return true;        }                int left,right;        if(isBalanced(root->left,&left) && isBalanced(root->right,&right)){            int diff=left-right;            if(diff<=1 && diff>=-1){                *depth=1+(left>right?left:right);                return true;            }        }        return false;    }    };

同樣思路的Java代碼沒過，誰能告訴我問題所在，因為參數的問題嗎？

/** * 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) {        int depth=0;        return isBalanced(root,depth);    }    public boolean isBalanced(TreeNode node,int depth){        if(node == null){            return true;        }         int leftDepth=0,rightDepth=0;        if( isBalanced(node.left,leftDepth) && isBalanced(node.right,rightDepth) ){            int diff=leftDepth-rightDepth;            if(diff<=1 && diff>=-1){                depth=1+((leftDepth>rightDepth)?(leftDepth):(rightDepth));                return true;            }        }        return false;    }}