# 863. All Nodes Distance K in Binary Tree

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.

   def distanceK(self, root, target, K):
conn = collections.defaultdict(list)
def connect(parent, child):
if parent and child:
conn[parent.val].append(child.val)
conn[child.val].append(parent.val)
if child.left: connect(child, child.left)
if child.right: connect(child, child.right)
connect(None, root)
bfs = [target.val]
seen = set(bfs)
for i in xrange(K):
bfs = [y for x in bfs for y in conn[x] if y not in seen]
seen |= set(bfs)
return bfs

Java代码就有点长了

 public class leetcode863_All_Nodes_Distance_k_in_binary_tree {
Map<Integer, List<Integer>> map = new HashMap<>();
public  List<Integer> distanceK(TreeNode root, TreeNode target, int K) {
List<Integer> bfs = new ArrayList<>();
makeMap_with_recus(null, root);
if (map.isEmpty()) {
return null;
}
Set<Integer> visit = new HashSet<>(bfs);
for (int i = 0; i < K; i++) {
List<Integer> temp = new ArrayList<>();
for (Integer item : bfs) {
for (int val : map.get(item)) {
if (!visit.contains(val)) {
}
}
}
bfs = new ArrayList<>(temp);
}

return bfs;
}
public  void makeMap_with_recus(TreeNode parent, TreeNode child) {
if (parent != null && child != null) {
if (map.containsKey(parent.val)) {
}
else {
List<Integer> list = new ArrayList<>();
map.put(parent.val,list);
}

if (map.containsKey(child.val)) {
}
else {
List<Integer> list = new ArrayList<>();
map.put(child.val,list);
}
}
if (child.left != null) {
makeMap_with_recus(child, child.left);
}
if (child.right != null) {
makeMap_with_recus(child, child.right);
}
}

}