LeetCode 863. All Nodes Distance K in Binary Tree

原题链接在这里：https://leetcode.com/problems/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.

题解：

Clone this tree with new type of Node containing a pointer to parent.

Find the cloned target node and do BFS from it.

Time Complexity: O(n). Deep clone takes O(n). BFS takes O(n).

Time Complexity: O(n). Regardless res.

AC Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    Node clonedTargetNode;
    public List<Integer> distanceK(TreeNode root, TreeNode target, int K) {
        List<Integer> res = new ArrayList<Integer>();
        if(root == null){
            return res;
        }
        
        deepClone(root, null, target);
        LinkedList<Node> que = new LinkedList<Node>();
        que.add(clonedTargetNode);
        
        HashSet<Node> used = new HashSet<Node>();
        used.add(clonedTargetNode);
        while(!que.isEmpty()){
            int size = que.size();
            if(K==0){
                for(int i = 0; i<size; i++){
                    res.add(que.poll().val);
                }
                
                return res;
            }
            
            for(int i = 0; i<size; i++){
                Node cur = que.poll();
                if(cur.parent != null && !used.contains(cur.parent)){
                    que.add(cur.parent);
                    used.add(cur.parent);
                }
                
                if(cur.left != null && !used.contains(cur.left)){
                    que.add(cur.left);
                    used.add(cur.left);
                }
                
                if(cur.right != null && !used.contains(cur.right)){
                    que.add(cur.right);
                    used.add(cur.right);
                }
            }
            
            K--;
        }
        
        return res;
    }
    
    private Node deepClone(TreeNode root, Node parent, TreeNode target){
        if(root == null){
            return null;
        }
        
        Node clonedRoot = new Node(root.val);
        if(root == target){
            clonedTargetNode = clonedRoot;
        }
        
        clonedRoot.parent = parent;
        clonedRoot.left = deepClone(root.left, clonedRoot, target);
        clonedRoot.right = deepClone(root.right, clonedRoot, target);
        return clonedRoot;
    }
}

class Node{
    int val;
    Node parent;
    Node left;
    Node right;
    Node(int x){
        this.val = x;
    }
}