首页 > 代码库 > leetcode 199. Binary Tree Right Side View 求所能看到的叶子节点 ---------- java
leetcode 199. Binary Tree Right Side View 求所能看到的叶子节点 ---------- java
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
1 <--- / 2 3 <--- \ 5 4 <---
You should return [1, 3, 4]
.
使用队列,层次遍历,每一层的最后一个节点。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public List<Integer> rightSideView(TreeNode root) { List<Integer> list = new ArrayList(); if (root == null){ return list; } Queue<TreeNode> queue = new LinkedList(); queue.add(root); while(!queue.isEmpty()){ int size = queue.size(); for (int i = 0; i < size; i++){ TreeNode node = queue.poll(); if (node.left != null){ queue.add(node.left); } if (node.right != null){ queue.add(node.right); } if (i == size - 1){ list.add(node.val); } } } return list; } }
leetcode 199. Binary Tree Right Side View 求所能看到的叶子节点 ---------- java
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。