-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathKth Smallest Element In Tree.cpp
83 lines (58 loc) · 1.24 KB
/
Kth Smallest Element In Tree.cpp
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
void find_ans(TreeNode *root,int &temp int &ans)
{
if(root==NULL)
return ;
find_ans(root->left,temp,ans) ;
temp--;
if(temp==0)
{
ans=root->val ;
temp-- ;
return ;
}
find_ans(root->right,temp,ans) ;
}
int Solution::kthsmallest(TreeNode* root, int B) {
int temp=B;
int ans;
find_ans(root,temp,ans);
return ans;
}
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
void find_ans(TreeNode *root,int &temp int &ans)
{
if(root==NULL)
return ;
find_ans(root->left,temp,ans) ;
temp--;
if(temp==0)
{
ans=root->val ;
temp-- ;
return ;
}
find_ans(root->right,temp,ans) ;
}
int Solution::kthsmallest(TreeNode* root, int B) {
int temp=B;
int ans;
find_ans(root,temp,ans);
return ans;
}