Binary Tree Right Side view using recursion traversal.cpp

Code

class Solution {
public:
    map<int, int> rightside;
    void find(TreeNode* root, int num){
        if(root == NULL) return;
        rightside[num] = root->val;
        find(root->left, num+1);
        find(root->right, num+1);
    }
    
    vector<int> rightSideView(TreeNode* root) {
        
        if(root == NULL) return {};
        find(root, 0);
        vector<int> ans;
        for(auto it: rightside){
            ans.push_back(it.second);
        }
        
        return ans; 
    }
}