Leetcode100：Same Tree 判断两棵树是否完全相等

原创于 2017-10-26 14:02:28 发布 · 510 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 同时被 2 个专栏收录

47 篇文章

订阅专栏

Leetcode

47 篇文章

订阅专栏

本文介绍了一种通过递归方法来判断两个二叉树是否等价的有效算法。该算法首先检查两个根节点是否为空，然后比较它们的值是否相等，并继续递归地检查左右子树。

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.

递归实现


public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int x) { val = x; }
    }

    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);
         return false;
    }