LintCode 760: Binary Tree Right Side View

760. 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

Example
Example 1

Input: {1,2,3,#,5,#,4}
Output: [1,3,4]
Explanation:
1
/
2 3
\
5 4
Example 2

Input: {1,2,3}
Output: [1,3]
Explanation:
1
/
2 3

解法1：
按层次遍历
代码同步更新在https://github.com/luqian2017/Algorithm

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the root of the given tree
     * @return: the values of the nodes you can see ordered from top to bottom
     */
    vector<int> rightSideView(TreeNode * root) {
        if (!root) return {};
        vector<int> result;
        queue<TreeNode *> q;
        q.push(root);
        
        while(!q.empty()) {
            int qSize = q.size();  
            TreeNode * node = NULL;
            for (int i = 0; i < qSize; ++i) {
                node = q.front();
                q.pop();
                if (node->left) q.push(node->left);
                if (node->right) q.push(node->right);
            }
            result.push_back(node->val);
        }
    
        return result;
    }
};