Class Solution
java.lang.Object
g0901_1000.s0993_cousins_in_binary_tree.Solution
993 - Cousins in Binary Tree.<p>Easy</p>
<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><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2019/02/12/q1248-01.png" alt="" /></p>
<p><strong>Input:</strong> root = [1,2,3,4], x = 4, y = 3</p>
<p><strong>Output:</strong> false</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2019/02/12/q1248-02.png" alt="" /></p>
<p><strong>Input:</strong> root = [1,2,3,null,4,null,5], x = 5, y = 4</p>
<p><strong>Output:</strong> true</p>
<p><strong>Example 3:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2019/02/13/q1248-03.png" alt="" /></p>
<p><strong>Input:</strong> root = [1,2,3,null,4], x = 2, y = 3</p>
<p><strong>Output:</strong> false</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>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
isCousins
-