aboutsummaryrefslogtreecommitdiff
path: root/binary_tree_right_view.cpp
blob: e5a040cba316a635d2479bf027a6b4cd51a1a58c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include "leetcode.h"

class Solution {
public:
  vector<int> rightSideView(TreeNode *root) {
    queue<TreeNode *> q;
    vector<int> ans;
    if (!root)
      return ans;
    q.push(root);
    while (!q.empty()) {
      ans.push_back(q.back()->val);
      for (int i = q.size(); i > 0; i--) {
        TreeNode *n = q.front();
        q.pop();
        if (n->left)
          q.push(n->left);
        if (n->right)
          q.push(n->right);
      }
    }
    return ans;
  }
};