Binary Tree Distance K from Target Node

Prereq: BFS on Tree

Given a binary tree, an integer that represents the target node's value, and an integer K, return a list of the values of all the nodes whose depth (level) is K away from the target node's depth. Order of returned nodes does not matter.



Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

Contrary to popular belief, Lorem Ipsum is not simply random text.

1  >>> a = [1, 2, 3]
2  >>> a[-1]
3  3

Get premium for instant access to all content and solutions