首页 > itarticle > leetcode100. same tree

leetcode100. same tree

admin 11月 13, 2020 0

递归判断两个二叉树的节点值是否相同，代码特别简单。

100. Same Tree

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

1
2
3
4
5
6
7
 
Input:     1         1
          /        / 
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

1
2
3
4
5
6
7
 
Input:     1         1
          /           
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

1
2
3
4
5
6
7
 
Input:     1         1
          /        / 
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false
 
1
2
3
4
5
6
7
 
public boolean (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;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能