[LC] 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:
- 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
.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { Map<TreeNode, List<TreeNode>> map = new HashMap<>(); public List<Integer> distanceK(TreeNode root, TreeNode target, int K) { List<Integer> res = new ArrayList<>(); Queue<TreeNode> queue = new LinkedList<>(); Set<TreeNode> visited = new HashSet<>(); buildMap(root, null); queue.offer(target); visited.add(target); while(!queue.isEmpty()) { if (K == 0) { int resSize = queue.size(); for (int i = 0; i < resSize; i++) { res.add(queue.poll().val); } return res; } int size = queue.size(); for (int i = 0; i < size; i++) { TreeNode cur = queue.poll(); for (TreeNode nei : map.get(cur)) { if (visited.contains(nei)) { continue; } queue.offer(nei); visited.add(nei); } } K--; } return res; } private void buildMap(TreeNode node, TreeNode parent) { if (node == null) { return; } map.put(node, new ArrayList<>()); if (parent != null) { map.get(parent).add(node); map.get(node).add(parent); } buildMap(node.left, node); buildMap(node.right, node); } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步