Lintcode 469. 等價二叉樹

標籤：ref   lan   als   tree   cal   .com   init   分享   src   

-----------------------------------------------

 

AC代碼：

/** * Definition of TreeNode: * public class TreeNode { *     public int val; *     public TreeNode left, right; *     public TreeNode(int val) { *         this.val = val; *         this.left = this.right = null; *     } * } */public class Solution {    /**     * @param a, b, the root of binary trees.     * @return true if they are identical, or false.     */    public boolean isIdentical(TreeNode a, TreeNode b) {        if(a==null && b==null) return true;        else if(a==null || b==null) return false;        else if(a.val!=b.val) return false;        return isIdentical(a.left,b.left) && isIdentical(a.right,b.right);    }}

 

 

題目來源： http://www.lintcode.com/zh-cn/problem/identical-binary-tree/

Lintcode 469. 等價二叉樹