(1)map
/**
* 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 {
private:
map<int,vector<int>> mp;
public:
void helper(TreeNode *root,int h) {
if(!root) return;
mp[h].push_back(root->val);
helper(root->left,h+1);
helper(root->right,h+1);
return;
}
vector<int> rightSideView(TreeNode* root) {
helper(root,0);
vector<int> v;
for(auto it=mp.begin();it!=mp.end();it++) {
v.push_back(it->second[it->second.size()-1]);
}
return v;
}
};