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.

题意是让我们在一颗二叉树中,给定节点 Target, 寻找和target节点距离 为 K的所有节点,我们可以把这颗树看成一个无向图, 没有顺序就意味着,二叉树的旁边的指节也是可以算距离的。
我们可以先把二叉树转化为无向图,再在图中进行 DFS 搜索应该就可以得到答案。
在这里我给出了Python代码, 和Java代码。

   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<>();
        bfs.add(target.val);
        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)) {
                        temp.add(val);
                    }
                }
            }
            bfs = new ArrayList<>(temp);
            visit.addAll(temp);
        }


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

            if (map.containsKey(child.val)) {
                map.get(child.val).add(parent.val);
            }
            else {
                List<Integer> list = new ArrayList<>();
                list.add(parent.val);
                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);
        }
    }

}

哈哈,终于放假了, 可以好好写代码了。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
As an AI language model, I cannot provide you with the exact solution you need without further details. However, here is a general approach to find the longest distance in a binary tree using Python: 1. Define a class for a binary tree node with attributes for the node value, left child, and right child. 2. Define a function that recursively traverses the binary tree and returns the height of the tree starting from a given node. 3. Define a function that recursively traverses the binary tree and returns the longest distance between two nodes in the tree. 4. In the function defined in step 3, for each node, calculate the longest distance that passes through that node and update the maximum distance seen so far. 5. Call the function defined in step 3 starting from the root node of the binary tree. Here is a sample implementation of the above approach: ``` class Node: def __init__(self, value): self.value = value self.left = None self.right = None def height(root): if root is None: return 0 return 1 + max(height(root.left), height(root.right)) def longest_distance(root): if root is None: return 0 left_height = height(root.left) right_height = height(root.right) left_distance = longest_distance(root.left) right_distance = longest_distance(root.right) return max(left_height + right_height, max(left_distance, right_distance)) root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) root.right.left = Node(6) root.right.right = Node(7) print(longest_distance(root)) ``` This code will output the longest distance between any two nodes in the binary tree.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值