mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
34 lines
1.2 KiB
HTML
34 lines
1.2 KiB
HTML
|
<p>Given the roots of two binary trees <code>p</code> and <code>q</code>, write a function to check if they are the same or not.</p>
|
||
|
|
|
||
|
|
<p>Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg" style="width: 622px; height: 182px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> p = [1,2,3], q = [1,2,3]
|
||
|
|
<strong>Output:</strong> true
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg" style="width: 382px; height: 182px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> p = [1,2], q = [1,null,2]
|
||
|
|
<strong>Output:</strong> false
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg" style="width: 622px; height: 182px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> p = [1,2,1], q = [1,1,2]
|
||
|
|
<strong>Output:</strong> false
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>The number of nodes in both trees is in the range <code>[0, 100]</code>.</li>
|
||
|
|
<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li>
|
||
|
|
</ul>
|