Given the root of a binary tree and two distinct values x and y, determine whether the nodes with values x and y are cousins.

Two nodes are cousins if they are at the same depth in the tree but have different parent nodes. Return true if they are cousins, otherwise return false.

Note: The values x and y are guaranteed to appear somewhere in the tree.

Constraints:

• The number of nodes in the tree is in the range $[2, 100]$

• $1 \leq$ Node.val $\leq 100$

• Each node value in the tree is unique

• x $\neq$ y

• x and y exist in the tree

Input: root = [1, 2, 3, 4, null, null, 5]-TreeNode, x = 4-int, y = 5-int
Output: true-bool
Explanation: Node 4 is the left child of 2, and node 5 is the right child of 3. Both nodes are at the same depth (depth 2) but have different parents, so they are cousins.

Input: root = [1, 2, 3, null, 4]-TreeNode, x = 2-int, y = 3-int
Output: false-bool
Explanation: Nodes 2 and 3 are at the same depth (depth 1), but they share the same parent (1), making them siblings, not cousins.

Input: root = [1, 2, 3, 4, 5, null, null]-TreeNode, x = 4-int, y = 5-int
Output: false-bool
Explanation: Nodes 4 and 5 are both children of node 2. Since they have the same parent, they are siblings, not cousins (even though they are at the same depth).

Input: root = [1, 2, 3, 4, null, null, 5, null, 6]-TreeNode, x = 6-int, y = 5-int
Output: false-bool
Explanation: Node 6 is deeper in the tree than node 5 (different depths). Cousins must be at the same depth, so the answer is false.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.