class Solution{
    private:
        void visibleNodesUtil(Tree *root, int greater, vector<int> &nodes){
            if(!root) return;
            if(root->val > greater) nodes.push_back(root->val);
            visibleNodesUtil(root->left, max(greater, root->val), nodes);
            visibleNodesUtil(root->right, max(greater, root->val), nodes);
        }
    public:
        vector<int> visibleNodes(Tree *root){
            vector<int> nodes;
            visibleNodesUtil(root, INT_MIN, nodes);
            sort(nodes.begin(), nodes.end());
            return nodes;
        }
};