[Leetcode] 863. All Nodes Distance K in Binary Tree 找出距离某个点距离为k的所有的点

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.

 

思路：

将这个tree转换成一个无向图，然后就转变成图的问题

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def distanceK(self, root: TreeNode, target: TreeNode, K: int) -> List[int]:
        rlt = []
        g = collections.defaultdict(set)
        def helper(node: TreeNode):
            if node:
                if node.left:
                    g[node.val].add(node.left.val)
                    g[node.left.val].add(node.val)
                    helper(node.left)
                if node.right:
                    g[node.val].add(node.right.val)
                    g[node.right.val].add(node.val)
                    helper(node.right)
        helper(root)
        book = set([target.val])
        def findNodes(point, cnt):
            if cnt == K:
                rlt.append(point)
                return
            if point in g:
                for child in g[point]:
                    if child not in book:
                        book.add(child)
                        findNodes(child, cnt + 1)
        findNodes(target.val, 0)
        return rlt