LeetCode 199. Binary Tree Right Side View（二叉树）

题目来源：https://leetcode.com/problems/binary-tree-right-side-view/

问题描述

199. Binary Tree Right Side View

Medium

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.

Example:

Input: [1,2,3,null,5,null,4]

Output: [1, 3, 4]

Explanation:

 

   1            <---

 /   \

2     3         <---

 \     \

  5     4       <---

------------------------------------------------------------

题意

给定一个二叉树，求从右侧看这棵二叉树得到的数列

------------------------------------------------------------

思路

二叉树的层次化遍历（先右后左）

------------------------------------------------------------

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    class QueueNode {
        int level;
        TreeNode tn;
        
        public QueueNode(int level, TreeNode tn) {
            this.level = level;
            this.tn = tn;
        }
    }
    
    public List<Integer> rightSideView(TreeNode root) {
        if (root == null) {
            return Collections.emptyList();
        }
        List<Integer> ans = new ArrayList<Integer>();
        LinkedList<QueueNode> queue = new LinkedList<QueueNode>();
        ans.add(root.val);
        queue.add(new QueueNode(0, root));
        int curLevel = 0;
        while (!queue.isEmpty()) {
            QueueNode qn = queue.removeFirst();
            if (qn.level > curLevel) {
                curLevel = qn.level;
                ans.add(qn.tn.val);
            }
            if (qn.tn.right != null) {
                queue.add(new QueueNode(curLevel + 1, qn.tn.right));
            }
            if (qn.tn.left != null) {
                queue.add(new QueueNode(curLevel + 1, qn.tn.left));
            }
        }
        return ans;
    }
}