Balanced Binary Tree (Java code failed, why ???), Balancedbinary

Source: Internet
Author: User

Balanced Binary Tree (Java code failed, why ???), 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;    }    };
The Java code of the same idea has not passed. Can someone tell me the problem because of the parameter problem?
/** * 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;    }}





Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.