mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
57 lines
798 B
Markdown
57 lines
798 B
Markdown
# [100. Same Tree](https://leetcode.com/problems/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:
|
|
|
|
|
|
```c
|
|
Input: 1 1
|
|
/ \ / \
|
|
2 3 2 3
|
|
|
|
[1,2,3], [1,2,3]
|
|
|
|
Output: true
|
|
```
|
|
|
|
Example 2:
|
|
|
|
```c
|
|
Input: 1 1
|
|
/ \
|
|
2 2
|
|
|
|
[1,2], [1,null,2]
|
|
|
|
Output: false
|
|
```
|
|
|
|
Example 3:
|
|
|
|
```c
|
|
Input: 1 1
|
|
/ \ / \
|
|
2 1 1 2
|
|
|
|
[1,2,1], [1,1,2]
|
|
|
|
Output: false
|
|
```
|
|
|
|
## 题目大意
|
|
|
|
这一题要求判断 2 颗树是否是完全相等的。
|
|
|
|
|
|
## 解题思路
|
|
|
|
递归判断即可。
|
|
|
|
|