标签：
https://leetcode.com/problems/binary-tree-right-side-view/
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].
解题思路：
这题比较简单了，层次遍历，每层输出最后一个node就可以了。
/** * Definition for binary tree * 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<Integer>(); if(root == null) { return result; } Queue<TreeNode> queue = new LinkedList<TreeNode>(); queue.offer(root); while(queue.size() > 0) { int size = queue.size(); while(size > 0) { TreeNode current = queue.poll(); if(current.left != null) { queue.offer(current.left); } if(current.right != null) { queue.offer(current.right); } if(size == 1) { result.add(current.val); } size--; } } return result; } }
标签：
原文地址：http://www.cnblogs.com/NickyYe/p/4447961.html
