zoukankan      html  css  js  c++  java
  • 剑指 Offer 54. 二叉搜索树的第k大节点

    /**
     * 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:
        int ans;
    
        int kthLargest(TreeNode* root, int k) {
            dfs(root, k);
            return ans;
        }
    
        void dfs(TreeNode* root, int& k) {
            if (!root || !k) return;
            
            dfs(root->right, k);
            
            k--;
            if (k == 0) ans = root->val;
            
            dfs(root->left, k);
        }
    };
    
  • 相关阅读:
    Django01
    WEB框架介绍
    前端插件介绍
    JQuery
    DOM
    js
    css
    HTML
    图片懒加载
    js中style,currentStyle和getComputedStyle的区别
  • 原文地址:https://www.cnblogs.com/fxh0707/p/15093297.html
Copyright © 2011-2022 走看看