199. 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; } * } */ class Solution { public List<Integer> rightSideView(TreeNode root) { Queue<TreeNode> queue = new LinkedList<>(); List<Integer> result = new ArrayList<>(); if(root == null) return result; queue.offer(root); while (!queue.isEmpty()){ int size = queue.size(); for (int i = 0; i < size; i++){ TreeNode cur = queue.poll(); if(i == 0){ result.add(cur.val); } if(cur.right != null) queue.offer(cur.right); if(cur.left != null) queue.offer(cur.left); } } return result; } }
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。