Practice All Nodes Distance K 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.

Medium#863

LeetCode Problem

All Nodes Distance K in Binary Tree

Hash Table Tree Depth-First Search Breadth-First Search Binary Tree

Problem Statement

Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the target node. You can return the answer in any order.

Source: All Nodes Distance K in Binary Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

root = [3,5,1,6,2,0,8,null,null,7,4], target = 5, k = 2

Output

[7,4,1]

# Example 2

Input

root = [1], target = 1, k = 3

Output

[]

Constraints

The number of nodes in the tree is in the range [1, 500].

0 <= Node.val <= 500

All the values Node.val are unique.

target is the value of one of the nodes in the tree.

0 <= k <= 1000

Review your practice with PhantomCodeAI

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

Start Free