算法思路:实际上就是优先右子树的层序遍历,所以还是用队列来进行层序遍历
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
// 优先右子树的层序遍历
vector<int> rightSideView(TreeNode* root) {
if (!root)
return {};
vector<int> res;
queue<TreeNode*> que;
que.push(root);
int level = 1;
while (!que.empty()) {
int len = que.size();
for (int i=0; i<len; ++i) {
TreeNode* cur = que.front();
que.pop();
if (i == 0) // 每层右边第一个节点放入res
res.push_back(cur->val);
if (cur->right)
que.push(cur->right);
if (cur->left)
que.push(cur->left);
}
level++;
}
return res;
}
};