2023.5.30 Problem: 100. Same Tree

[umdreamer]

100. Same Tree Problem Link

Given the roots of two binary trees p and q, 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:

Input: p = [1,2,3], q = [1,2,3]
Output: true

Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false

Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:

• The number of nodes in both trees is in the range [0, 100].
• -104 <= Node.val <= 104

[tangyexi]

[xiaolu2002]

[huangyumei1]

[htywan]

[ZWJ2212061008]

[cuixiao02]

[gusuning]

[zhjingyan]

[Lggg1234]

[promisewith7]

[mafanjia]

[123lrb]

[PinkyLame]

[12baoxingyu-6]

[sjh397]

[liu-si-han]

[1125766961]

[yeyuxq]

[syr2212061031]

[liuhuanyu6]

[xkqwww]

[zxm-1235]

[24zlx]

[naqianqpg]

[daowuwu]

[zyhzxy99]

[wangshiqi7]

[bedauern]

[foxbou]

[zangfushuo]

[shylieisme]

[686xiaozhang]