Solution: Cousins in Binary Tree

Statement

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]$ ...