-
Notifications
You must be signed in to change notification settings - Fork 0
/
LowestCommonAncestor.cpp
96 lines (75 loc) · 1.45 KB
/
LowestCommonAncestor.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
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *left;
Node *right;
Node(int d)
{
data = d;
left = NULL;
right = NULL;
}
};
class Solution
{
public:
Node *insert(Node *root, int data)
{
if (root == NULL)
{
return new Node(data);
} else
{
Node *cur;
if (data <= root->data)
{
cur = insert(root->left, data);
root->left = cur;
} else
{
cur = insert(root->right, data);
root->right = cur;
}
return root;
}
}
/*The tree node has data, left child and right child
class Node {
int data;
Node* left;
Node* right;
};
*/
Node *lca(Node *root, int v1, int v2)
{
if (v1 < root->data and v2 < root->data)
{
return lca(root->left, v1, v2);
} else if (v1 > root->data and v2 > root->data)
{
return lca(root->right, v1, v2);
}
return root;
}
}; //End of Solution
int main()
{
Solution myTree;
Node *root = NULL;
int t;
int data;
std::cin >> t;
while (t-- > 0)
{
std::cin >> data;
root = myTree.insert(root, data);
}
int v1, v2;
std::cin >> v1 >> v2;
Node *ans = myTree.lca(root, v1, v2);
std::cout << ans->data;
return 0;
}