← Questions
All nodes at distance K in a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary tree, a target node and k, return every node exactly k edges away from the target. Add parent links (or turn the tree into an undirected graph), then search outward from the target without revisiting nodes.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding