Get largest value in tree depth using depth first search

largestOfDepth.js

function largestValuesInTreeRows(t) {
    function depthSearch(current) {
        let values = [];
        let depth = 0;
        
        function traverse(current, depth) {
            if (!current) {
                return;
            }
            
            if (!values[depth]) {
                values[depth] = current.value;
            }
            else {
                if (current.value > values[depth]) {
                    values[depth] = current.value;
                }
            }
            
            traverse(current.left, depth + 1);
            traverse(current.right, depth + 1);
        }
        
        traverse(current, depth);
        
        return values;
    }
    
    return depthSearch(t);
}