LeetCode解题分享：863. All Nodes Distance K in Binary Tree

最新推荐文章于 2022-07-08 08:19:09 发布

子为空

最新推荐文章于 2022-07-08 08:19:09 发布

阅读量379

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/davincil/article/details/100127182

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

Problem

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:

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

解题思路

这一题有一个最简单的思路，就是我们将这棵树转化成一张有向图（无向图），然后从目标节点出发，按照BFS去层次遍历，一层一层向外扩散，一直扩散K层。最后返回剩下的队列里的节点即可。

代码如下：

# 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, target, K):
        """
        :type root: TreeNode
        :type target: TreeNode
        :type K: int
        :rtype: List[int]
        """
        graph = [[] for _ in range(500 + 1)]
        self.build_graph(root, graph)

        queue = [target.val]
        visited = [False for _ in  range(501)]
        level = 0
        while level < K:
            length = len(queue)

            for _ in range(length):
                node = queue.pop(0)

                visited[node] = True

                for next in graph[node]:
                    if visited[next] == False:
                        queue.append(next)
            level += 1
        return queue

    def build_graph(self, root, graph):
        if root is None:
            return
        if root.left:
            graph[root.val].append(root.left.val)
            graph[root.left.val].append(root.val)

        if root.right:
            graph[root.val].append(root.right.val)
            graph[root.right.val].append(root.val)

        self.build_graph(root.left, graph)
        self.build_graph(root.right, graph)


# if __name__ == '__main__':
#     a = TreeNode(3)
#     a.left = TreeNode(5)
#     a.left.left = TreeNode(6)
#     a.left.right = TreeNode(2)
#     a.left.right.left = TreeNode(7)
#     a.left.right.right = TreeNode(4)
#     a.right = TreeNode(1)
#     a.right.left = TreeNode(0)
#     a.right.right = TreeNode(8)

#     print(Solution().distanceK(a, a.left, 2))