And query the path compression of the Set (recursive and non-recursive)

The idea here is that we change the father of every child into his ancestor every time we look for Father's Day. Because it is possible that a child's relationship is very complicated, it may be a chain, so there is no waste of time in searching. // This is a simple Recursive Implementation of find (int x) {While (X! = Father [x]) Father [x] = find (father [x]); Return father [X];} // This is a non-recursive find (int x) {int r = x; while (R! = Father [R]) // locate the r ancestor node r = Father [R]; int K = x; while (K! Father [k]) {FATHER [k] = r; k = Father [X]; X = K ;}}