给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4]
输出: [1, 3, 4]
解释:
1 <---
/ \
2 3 <---
\ \
5 4 <---
通过次数24,435提交次数38,142
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-right-side-view
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路: BFS,是否 是最右侧的依据:如果当前的level !=队首的level,那么这个值 肯定是右侧看到的、(除了队列中最后一个元素)
/**
* 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:
struct node{
TreeNode* tree;
int level;
};
vector<int> rightSideView(TreeNode* root) {
vector<int> ans;
if(root==NULL) return ans;
queue<node> q;
node tmp;
tmp.tree = root;
tmp.level = 1;
q.push(tmp);
while(!q.empty()){
node front = q.front();
q.pop();
if(!q.empty()){
node front1 = q.front();
if(front.level!=front1.level)
ans.push_back(front.tree->val);
}
else{
ans.push_back(front.tree->val);
}
if(front.tree->left!=NULL){
tmp.tree = front.tree->left;
tmp.level = front.level+1;
q.push(tmp);
}
if(front.tree->right!=NULL){
tmp.tree = front.tree->right;
tmp.level = front.level+1;
q.push(tmp);
}
}
return ans;
}
};