[leetcode] SameTree

/**
* <pre>
* Given two binary trees, write a function to check if they are equal or not.
*
* Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
* </pre>
*/
public class SameTree {

    public class TreeNode {
        int      val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    public class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if (p == q)
                return true;
            if (p == null || q == null)
                return false;
            return p.val == q.val && isSameTree(p.left, q.left)
                    && isSameTree(p.right, q.right);
        }
    }
}

评论

1 楼 cywhoyi 2014-12-16  

leetcode的题目很有趣