-
Notifications
You must be signed in to change notification settings - Fork 1
/
Shortest_Distance_between_2_nodes.cpp
73 lines (59 loc) · 1.11 KB
/
Shortest_Distance_between_2_nodes.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
#include <iostream>
using namespace std;
class Node{
public:
int data;
Node *left,*right;
Node(int val){
data=val;
left=right=NULL;
}
};
Node * LCA(Node *root,int n1,int n2){
if(root==NULL){
return NULL;
}
if(root->data==n1 && root->data==n2){
return root;
}
Node *left=LCA(root->left,n1,n2);
Node *right=LCA(root->right,n1,n2);
if(root->left !=NULL && root->right !=NULL){
return root;
}
if(left==NULL && right==NULL){
return NULL;
}
if(left!=NULL){
return LCA(root->left,n1,n2);
}
return LCA(root->right,n1,n2);
}
int findDist(Node *root,int k,int dist){
if(root==NULL){
return -1;
}
if(root->data==k){
return dist;
}
int left=findDist(root->left,k,dist+1);
if(left!=-1){
return left;
}
return findDist(root->right,k,dist+1);
}
int distBwNodes(Node *root,int n1,int n2){
Node *lca=LCA(root,n1,n2);
int d1=findDist(lca,n1,0);
int d2=findDist(lca,n2,0);
return d1+d2;
}
int main(){
Node *root=new Node(1);
root->left=new Node(2);
root->right=new Node(3);
root->left->left=new Node(4);
root->right->right=new Node(5);
cout<<distBwNodes(root,4,5)<<endl;
return 0;
}