code: public int find(int element) {
          if (trees[element] != element)
              trees[element] = find(trees[element]);
          return trees[element];
      }
docs: Return the set where the given element is. This implementation compresses
  the followed path.
  
  @param element
  @return