美文网首页ACM题库~
LeetCode 100. Same Tree

LeetCode 100. Same Tree

作者: 关玮琳linSir | 来源:发表于2017-09-27 15:59 被阅读11次

    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.

    题意:判断两个树,形状和各个节点上的值是否完全相同。

    java代码:

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

    相关文章

      网友评论

        本文标题:LeetCode 100. Same Tree

        本文链接:https://www.haomeiwen.com/subject/hjmuextx.html