leetCode #110 Balanced Binary Tree

题目：判断一个二叉树是不是平衡二叉树（任意左右子树深度差不超过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) {
		if (root == NULL)
			return true;
		else
		{
			int delta_d = dfs_getDepth(root->left, 0) - dfs_getDepth(root->right, 0);
			if (abs(delta_d) > 1)
				return false;
			else
				return isBalanced(root->left) && isBalanced(root->right);
		}
			 
	}
private:
	int dfs_getDepth(TreeNode *node, int currentDepth){
		if (node == NULL)
			return currentDepth;
		else
			return my_max(dfs_getDepth(node->left, currentDepth + 1), dfs_getDepth(node->right, currentDepth + 1));

	}
private:
	int my_max(int a, int b)
	{
		if (a > b)
			return a;
		else
			return b;
	}

};