leetcode:Balanced Binary Tree

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.

判断一颗二叉树，各个节点的左右子树深度是否相同。

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12    int flag=true;
13     int dfs(TreeNode *root)
14     {
15          if(root==NULL) return true;
16          int h1,h2;
17          if(root->left==NULL) h1=0;
18          else h1=dfs(root->left);
19          if(root->right==NULL) h2=0;
20          else h2=dfs(root->right);
21          if(abs(h1-h2)>1) flag=0;
22          return max(h1,h2)+1;
23     }
24     bool isBalanced(TreeNode *root) {
25         dfs(root);
26         return flag;
27     }
28 };

定义一个函数dfs，递归调用，对左右子节点的子树深度进行判断。

posted on 2015-04-26 16:08  何氏小萌  阅读(160)  评论(0)    收藏  举报