[Leetcode]Binary Tree Right Side View(TAT)

Binary Tree Right Side View My Submissions Question

Total Accepted: 26870 Total Submissions: 87779 Difficulty: 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.

For example:

Given the following binary tree,

1 <—

/ \

2 3 <—

\ \

5 4 <—

You should return [1, 3, 4].

Credits:

Special thanks to @amrsaqr for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

这道题终于一次AC了！！！！！！在被各种深搜贪心二分查找虐了一脸翔之后终于扬眉吐气了一把！！！

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> res;
//vector<int> tem;
if(!root)   return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
for(int i = 0,len = q.size();i < len;++i){
TreeNode* t = q.front();
q.pop();
if(i == len - 1){
res.push_back(t->val);
}
if(t->left) q.push(t->left);
if(t->right)    q.push(t->right);
}
//res.push_back(*(tem.end() - 1));
//tem.clear();
}
return res;
}
};

其实就是层序遍历，把每层的最后一个数字放进结果里，可以省略一下每层的tem