思路
宽搜,层次遍历
/**
* 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> ret;
queue<pair<TreeNode*,int> > Q;//<节点,层>
if(root){
Q.push(make_pair(root,0));
}
while(!Q.empty()){
TreeNode *node=Q.front().first;
int depth = Q.front().second;
Q.pop();
if(ret.size()==depth)
ret.push_back(node->val);
else {
ret[depth]=node->val;
}
if(node->left)
Q.push(make_pair(node->left,depth+1));
if(node->right)
Q.push(make_pair(node->right,depth+1));
}
return ret;
}
};