import
java.util.*;
class
GFG
{
static
int
MAX =
1000
;
static
int
findLCA(
int
n1,
int
n2,
int
parent[])
{
boolean
[]visited =
new
boolean
[MAX];
visited[n1] =
true
;
while
(parent[n1] != -
1
)
{
visited[n1] =
true
;
n1 = parent[n1];
}
visited[n1] =
true
;
while
(!visited[n2])
n2 = parent[n2];
return
n2;
}
static
void
insertAdj(
int
parent[],
int
i,
int
j)
{
parent[i] = j;
}
public
static
void
main(String[] args)
{
int
[]parent =
new
int
[MAX];
parent[
20
] = -
1
;
insertAdj(parent,
8
,
20
);
insertAdj(parent,
22
,
20
);
insertAdj(parent,
4
,
8
);
insertAdj(parent,
12
,
8
);
insertAdj(parent,
10
,
12
);
insertAdj(parent,
14
,
12
);
System.out.println(findLCA(
10
,
14
, parent));
}
}