题目描述:
给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4]
输出: [1, 3, 4]
解释:
1 <—
/
2 3 <—
\
5 4 <—
思路:
使用队列,层序遍历,返回每层最后一个数,(如果遍历的是先右节点,后左节点,则返回第一个数)
代码如下:
C++:
/**
* 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;
if(!root) return res;
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int s=q.size();
res.push_back(q.front()->val);
while(s--){
TreeNode* temp=q.front();
q.pop();
if(temp->right) q.push(temp->right);
if(temp->left) q.push(temp->left);
}
}
return res;
}
};
python:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def rightSideView(self, root: TreeNode) -> List[int]:
if not root:return []
res=[]
queue=[root]
while queue:
s=len(queue)
res.append(queue[0].val)
for _ in range(s):
temp=queue.pop(0)
if temp.right:
queue.append(temp.right)
if temp.left:
queue.append(temp.left)
return res