LeetCode -- Balanced Binary Tree

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。


思路：


判斷每個節點是否平衡
對於任何一個節點，判斷左右是否平衡。僅當左右子樹都平衡時，當前樹才算平衡。
分別求出左右子樹的高度，返回Math.Max(左子樹高度，右子樹高度)+1




實現代碼：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public bool IsBalanced(TreeNode root) 
    {
        if(root == null || root.left == null && root.right == null){
    		return true;
    	}
    	
    	var l = Depth(root.left);
    	var r = Depth(root.right);
    	if(Math.Abs(l-r) > 1){
    		return false;
    	}
    	
    	var bLeft = IsBalanced(root.left);
    	var bRight = IsBalanced(root.right);
    	return bLeft && bRight;
    }
	


    public int Depth(TreeNode node)
    {
        if(node == null){
        	return 0;
        }
        
        var l = Depth(node.left);
        var r = Depth(node.right);
        var len = Math.Max(l,r);
	    return len + 1;
    }


}