首页 > 代码库 > [LeetCode] 199. Binary Tree Right Side View
[LeetCode] 199. Binary Tree Right Side View
https://leetcode.com/problems/binary-tree-right-side-view/
/** * 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> result = new ArrayList<>(); if (root == null) { return result; } Queue<TreeNode> queue = new LinkedList<>(); queue.offer(root); int size = 1; int i = 0; while (!queue.isEmpty()) { TreeNode current = queue.poll(); if (current.left != null) { queue.offer(current.left); } if (current.right != null) { queue.offer(current.right); } i++; if (i == size) { result.add(current.val); i = 0; size = queue.size(); } } return result; } }
[LeetCode] 199. Binary Tree Right Side View
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。