Leetcode/leetcode230.cpp at main · ksaini-web/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:

int count = 0 ;
int ans = 0;

void inorder(TreeNode* root , int k){

    if(root== NULL){
        return;
    }

    inorder(root->left , k);

    count++;

    if(count == k){
        ans = root->val;
        return ;

    }

    inorder(root->right,k);


}


    int kthSmallest(TreeNode* root, int k) {

        inorder(root,k);

        return ans;

    }
};