LeetCode [863] All Nodes Distance K in Binary Tree

 863. All Nodes Distance K in Binary Tree

Medium

We are given a binary tree (with root node root), a target node, and an integer value K.

Return a list of the values of all nodes that have a distance K from the target node.  The answer can be returned in any order.

 

Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], target = 5, K = 2

Output: [7,4,1]

Explanation: 
The nodes that are a distance 2 from the target node (with value 5)
have values 7, 4, and 1.



Note that the inputs "root" and "target" are actually TreeNodes.
The descriptions of the inputs above are just serializations of these objects.

 

Note:

1. The given tree is non-empty.
2. Each node in the tree has unique values 0 <= node.val <= 500.
3. The target node is a node in the tree.
4. 0 <= K <= 1000.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

class Solution { Map<TreeNode, Integer> map = new HashMap<>(); public List<Integer> distanceK(TreeNode root, TreeNode target, int K) { List<Integer> res = new LinkedList<>(); find(root, target); dfs(root, target, K, map.get(root), res); return res; } // find target node first and store the distance in that path that we could use it later directly private int find(TreeNode root, TreeNode target) { if (root == null) return -1; if (root == target) { map.put(root, 0); return 0; } int left = find(root.left, target); if (left >= 0) { map.put(root, left + 1); return left + 1; } int right = find(root.right, target); if (right >= 0) { map.put(root, right + 1); return right + 1; } return -1; } private void dfs(TreeNode root, TreeNode target, int K, int length, List<Integer> res) { if (root == null) return; if (map.containsKey(root)) length = map.get(root); if (length == K) res.add(root.val); dfs(root.left, target, K, length + 1, res); dfs(root.right, target, K, length + 1, res); } }