(int node)
| 27 | } |
| 28 | |
| 29 | public int findRootParent(int node){ |
| 30 | if(node == parent[node]){ |
| 31 | return node; |
| 32 | } |
| 33 | parent[node] = findRootParent(parent[node]); |
| 34 | return parent[node]; |
| 35 | } |
| 36 | public boolean unionBySize(int node1, int node2){ |
| 37 | //1. find the root parent |
| 38 | int rootParent1 = findRootParent(node1); |