-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathclosestBST.cpp
More file actions
108 lines (93 loc) · 2.09 KB
/
Copy pathclosestBST.cpp
File metadata and controls
108 lines (93 loc) · 2.09 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<math.h>
using namespace std;
#define MAX 10000
int diff=MAX;
int value;
struct node{
int data;
struct node* left;
struct node* right;
};
struct node* root=NULL;
//Utility FUnctions
struct node* createNode(int data){
struct node* newNode=(struct node*)malloc(sizeof(struct node));
newNode->data=data;
newNode->left=NULL;
newNode->right=NULL;
return newNode;
};
void insertNode(struct node** root,int data){
if(*root==NULL){
*root=createNode(data);
return;// root;*/
}
if((*root)->data > data){
insertNode(&(*root)->left,data);
//insertNode(root->left,data);
}else if((*root)->data <= data){
insertNode(&(*root)->right,data);
}
}
void inorderTraversal(struct node* root){
if (root==NULL)
return;
inorderTraversal(root->left);
cout<<root->data<<" ";
inorderTraversal(root->right);
}
//int closestNode(struct node* root,int val)
//{
// if(root==NULL){
// return 1;
// }
// if(val<root->data){
// closestNode(root->left,val);
// }else{
// closestNode(root->right,val);
// }
// int dif=abs(val-root->data);
// if(diff>dif)
// {
// diff=dif;
// value=root->data;
// }
//
//
//}
//It's a bottom up approach
struct node* closestNode(struct node* root,int val,struct node* closestnode)
{
if(root==NULL){
return closestnode;
}
if(val<root->data){
closestnode=closestNode(root->left,val,closestnode);
}else{
closestnode=closestNode(root->right,val,closestnode);
}
int dif=abs(val-root->data);
if(diff>dif) //> or >=
{
diff=dif;
closestnode=root;
}
return closestnode;
}
int main(){
struct node* root=NULL;
insertNode(&root,2);
insertNode(&root,1);
insertNode(&root,7);
insertNode(&root,6);
insertNode(&root,8);
inorderTraversal(root);
//cout<<root;
//closestNode(root,-7);
struct node* close=closestNode(root,4,NULL);
cout<<endl;
cout<<"Value : "<<close->data;
}