第三题 Same Tree

最新推荐文章于 2022-08-08 10:42:17 发布

原创最新推荐文章于 2022-08-08 10:42:17 发布 · 323 阅读

0 ·

CC 4.0 BY-SA版权

CodeReview 专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一个用于检查两棵二叉树是否相同的算法。该算法通过递归方式判断两棵树在结构上是否一致且节点值是否相等。

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.

/**

 * Definition for binary tree

 * 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==null && q==null) return true;

        else if(p!=null && q!=null){

            if(p.val==q.val){

                return isSameTree(p.left, q.left)&&isSameTree(p.right, q.right);

            }

            return false;

        }

        return false;

        

    }

}