class Solution {
public:

    void dfs(vector<int>& ans,TreeNode* root,int curH)
    {
        if(ans.size() == curH)
        {
            ans.push_back(root->val);
        }
        else
        {
            ans[curH] = max(ans[curH],root->val);
        }

        if(root->left)
            dfs(ans,root->left,curH+1);
        
        if(root->right)
            dfs(ans,root->right,curH+1);
    }

    vector<int> largestValues(TreeNode* root) {
        if(!root)
            return {};

        vector<int> ans;
        dfs(ans,root,0);

        return ans;
    }
};