Balanced Binary Tree(Java代码没过,什么原因???)
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; } }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。