mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
39 lines
1.7 KiB
HTML
39 lines
1.7 KiB
HTML
|
<p>Given the <code>root</code> of a binary tree with unique values and the values of two different nodes of the tree <code>x</code> and <code>y</code>, return <code>true</code> <em>if the nodes corresponding to the values </em><code>x</code><em> and </em><code>y</code><em> in the tree are <strong>cousins</strong>, or </em><code>false</code><em> otherwise.</em></p>
|
||
|
|
|
||
|
|
<p>Two nodes of a binary tree are <strong>cousins</strong> if they have the same depth with different parents.</p>
|
||
|
|
|
||
|
|
<p>Note that in a binary tree, the root node is at the depth <code>0</code>, and children of each depth <code>k</code> node are at the depth <code>k + 1</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/02/12/q1248-01.png" style="width: 304px; height: 270px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> root = [1,2,3,4], x = 4, y = 3
|
||
|
|
<strong>Output:</strong> false
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/02/12/q1248-02.png" style="width: 334px; height: 266px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> root = [1,2,3,null,4,null,5], x = 5, y = 4
|
||
|
|
<strong>Output:</strong> true
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/02/13/q1248-03.png" style="width: 267px; height: 258px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> root = [1,2,3,null,4], x = 2, y = 3
|
||
|
|
<strong>Output:</strong> false
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>The number of nodes in the tree is in the range <code>[2, 100]</code>.</li>
|
||
|
|
<li><code>1 <= Node.val <= 100</code></li>
|
||
|
|
<li>Each node has a <strong>unique</strong> value.</li>
|
||
|
|
<li><code>x != y</code></li>
|
||
|
|
<li><code>x</code> and <code>y</code> are exist in the tree.</li>
|
||
|
|
</ul>
|