(int node)
| 42 | } |
| 43 | |
| 44 | public int findRootParent(int node){ |
| 45 | if(node == parent[node]){ |
| 46 | return node; |
| 47 | } |
| 48 | parent[node] = findRootParent(parent[node]); |
| 49 | return parent[node]; |
| 50 | } |
| 51 | public boolean unionBySize(int node1, int node2){ |
| 52 | //1. find the root parent |
| 53 | int rootParent1 = findRootParent(node1); |