Binary Tree Right Side View

[kokocan12]

Problem

When a tree is given and you are standing right side of tree.
Return values from top to bottom.

Approach

Using DFS with level, value of level is overwritten by right most value.

const rightSideView = function(root) {
    const res = [];
    
    function walk(node, level=0) {
        if(!node) return;
        
        res[level] = node.val;
        
        walk(node.left, level+1);
        walk(node.right, level+1);
    }
    
    walk(root);
    
    return res;
};