All Nodes Distance K in Binary Tree

Given the root of a binary tree, the value of a target node, 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.

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
View editorial solution
Saving… · 9 lines
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right

class Solution:
def allNodesDistanceKInBinaryTree(self, root: TreeNode, target: TreeNode, k: int) -> List[int]:
Console

Click Run to execute sample tests.