剑指offer | 二叉搜索树的第K个结点 | 38

思路分析

cpp

/**
 * 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:
    TreeNode* ans;
    int kthLargest(TreeNode* root, int k) {
        dfs(root,k);
        return ans->val;
    }
    
    void dfs(TreeNode* root,int &k){
        if(!root)return;
        dfs(root->right,k);
        k--;
        if(!k)ans = root;
        if(k>0)dfs(root->left,k);
    }
};

剑指offer | 二叉搜索树的第K个结点 | 38

原文：https://www.cnblogs.com/Rowry/p/14410974.html