力扣-剑指 Offer 54. 二叉搜索树的第k大节点（C++）- dfs

待我称王封你为后i 2022-09-11 06:14 14阅读 0赞

题目链接：[https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/][https_leetcode-cn.com_problems_er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof]  
题目如下：  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_17_color_FFFFFF_t_70_g_se_x_16]  
![在这里插入图片描述][ec5a6cf8c9034abc8b8d44f5d19b211b.png]

/**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
        
    public:
        void inorder(vector<int>& result,TreeNode* root){
        
            if(root==NULL) return ;
    
            if(root->left!=NULL) inorder(result,root->left);
            result.push_back(root->val);
            if(root->right!=NULL) inorder(result,root->right);
        }
        
        int kthLargest(TreeNode* root, int k) {
        
            if(root==NULL) return 0;
            vector<int> result;
            
            inorder(result,root);
            
            return result[result.size()-k];
        }
    };

[https_leetcode-cn.com_problems_er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof]: https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_17_color_FFFFFF_t_70_g_se_x_16]: /images/20220828/13e45afacd6b43c4802d555b443c2212.png
[ec5a6cf8c9034abc8b8d44f5d19b211b.png]: /images/20220828/09649de537f14ec6998b1c7f91eb51a4.png