All Nodes Distance K in Binary Tree: coding question

Available question text

Given a binary tree and a target node value, return all node values at distance K from the target. The challenge is to traverse both downwards and upwards (treat the tree as an undirected graph or add parent pointers) and perform a breadth-/depth-first search to collect nodes exactly K edges away.

Continue with questions that share topics or the same question type.

Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Maximum Depth of Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Smallest Common Region
Coding · Array · Binary Lifting · Breadth-First Search
Balanced Binary Tree
Coding · Binary Tree · Depth-First Search · Tree

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 3 records

Amazon
Leetcode 863. All Nodes Distance K in Binary Tree
Reported Oct 1, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 863. All Nodes Distance K in Binary Tree
Reported Mar 9, 2026 · 8 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source
Microsoft
Leetcode 863. All Nodes Distance K in Binary Tree
Reported Feb 17, 2026 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

TikTok

All Nodes Distance K in Binary Tree

Available question text

Related questions

All Nodes Distance K in Binary Tree

Available question text

Related questions