Skip to content

Practice Cousins in Binary Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#993
LeetCode Problem

Cousins in Binary Tree

TreeDepth-First SearchBreadth-First SearchBinary Tree

Problem Statement

Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the values x and y in the tree are cousins, or false otherwise. Two nodes of a binary tree are cousins if they have the same depth with different parents. Note that in a binary tree, the root node is at the depth 0, and children of each depth k node are at the depth k + 1.

Source: Cousins in Binary Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [1,2,3,4], x = 4, y = 3
Output
false

# Example 2

Input
root = [1,2,3,null,4,null,5], x = 5, y = 4
Output
true

# Example 3

Input
root = [1,2,3,null,4], x = 2, y = 3
Output
false

Constraints

The number of nodes in the tree is in the range [2, 100].
1 <= Node.val <= 100
Each node has a unique value.
x != y
x and y are exist in the tree.

Related LeetCode Problems

Practice more problems similar to Cousins in Binary Tree.

100 Same Tree Easy101 Symmetric Tree Easy104 Maximum Depth of Binary Tree Easy111 Minimum Depth of Binary Tree Easy112 Path Sum Easy
← Previous Subarrays with K Different IntegersNext → Rotting Oranges

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free