LeetCode - 230. Kth Smallest Element in a BST

题目

LeetCode - 230. Kth Smallest Element in a BST

题目链接

https://leetcode.com/problems/kth-smallest-element-in-a-bst/

参考博客

解题思路

解题源码

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