306. All Nodes Distance K in Binary Tree

MediumTree

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.

Examples

Input: [3,5,1,6,2,0,8,null,null,7,4] 5 2

Output: [7,4,1]

Explanation: Nodes at distance 2 from node 5 are 7, 4, and 1.

Constraints

The number of nodes in the tree is in the range [1, 500].
0 <= Node.val <= 500
All values are unique.
0 <= k <= 1000

Run checks all cases above. Submit evaluates all test cases.