## 题目

In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.

Two nodes of a binary tree are cousins if they have the same depth, but have different parents.

We are given the root of a binary tree with unique values, and the values x and y of two different nodes in the tree.

Return true if and only if the nodes corresponding to the values x and y are cousins.

Example 1:

Example 2:

Example 3:

Note:

• The number of nodes in the tree will be between 2 and 100.
• Each node has a unique integer value from 1 to 100.

## 思路

Easy题打卡。递归遍历二叉树，找到对应的x和y，并记录其depth和parent是否满足要求即可。