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.

思路：先把tree转换成图，怎么存图，因为tree里面的 value全部是unique的，那么可以直接用HashMap<Integer, List<Integer>> hashmap 来存图；build图的时候，因为有neighbor，从父节点来的，所以需要有parent作为参数传递；T: O(N), S: O(N).

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {
        List<Integer> list = new ArrayList<>();
        HashMap<Integer, List<Integer>> graph = new HashMap<>();
        buildGraph(root, null, graph);
        HashSet<Integer> visited = new HashSet<>();
        
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(target.val);
        visited.add(target.val);
        int step = 0;
        
        while(!queue.isEmpty()) {
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                Integer node = queue.poll();
                if(step == k) {
                    list.add(node);
                    continue;
                }
                for(Integer neighbor: graph.get(node)) {
                    if(!visited.contains(neighbor)) {
                        visited.add(neighbor);
                        queue.offer(neighbor);
                    }
                }
            }
            step++;
        }
        return list;
    }
    
    private void buildGraph(TreeNode root, TreeNode parent, HashMap<Integer, List<Integer>> graph) {
        if(root == null) {
            return;
        }
        graph.putIfAbsent(root.val, new ArrayList<Integer>());
        if(root.left != null) {
            graph.get(root.val).add(root.left.val);
            buildGraph(root.left, root, graph);
        }
        
        if(root.right != null) {
            graph.get(root.val).add(root.right.val);
            buildGraph(root.right, root, graph);
        }
        
        if(parent != null) {
            graph.get(root.val).add(parent.val);
        }
    }
}