kth smallest element in binary search tree

1#include<iostream>
2using namespace std;
3struct node
4{
5    int data;
6    node* left;
7    node* right;
8};
9int ans=0;
10node* getnode(int value)
11{
12    node* temp=new node;
13    temp->data=value;
14    temp->left=NULL;
15    temp->right=NULL;
16    return temp;
17}
18node *insert_bst(node *roots,int value)
19{
20    if(roots==NULL)
21    {
22        return getnode(value);
23    }
24    if(roots->data>value)
25    {
26        roots->left=insert_bst(roots->left,value);
27    }
28    else if(roots->data<value)
29    {
30        roots->right=insert_bst(roots->right,value);
31    }
32    return roots;
33}
34void findsol(node* roots,int *kth)
35{
36    if(roots==NULL)
37    {
38        return;
39    }
40    else
41    {
42        findsol(roots->left,kth);
43        (*kth)--;
44        if((*kth)==0)
45        {
46            ans=roots->data;
47        }
48        findsol(roots->right,kth);
49    }
50}
51int main()
52{
53    node* root=new node;
54    root=NULL;
55    int value;
56    do{
57        cin>>value;
58        if(value>0)
59        {
60            root=insert_bst(root,value);
61        }
62    }while(value>0);
63    int k;
64    cin>>k;
65    int* kth=&k;
66    findsol(root,kth);
67    cout<<ans;
68    return 0;
69}
70