Revert "Ad hoc versions of MinHeap, MaxHeap, and DisjointSet (trekhleb#1117)"

This reverts commit 2c67b48.

Author: souzaravinho

src/data-structures/disjoint-set/DisjointSetAdhoc.js

@@ -19,11 +19,6 @@ _MakeSet_ creates 8 singletons.
 
 After some operations of _Union_, some sets are grouped together.
 
-## Implementation
-
-- [DisjointSet.js](./DisjointSet.js)
-- [DisjointSetAdhoc.js](./DisjointSetAdhoc.js) - The minimalistic (ad hoc) version of a DisjointSet (or a UnionFind) data structure that doesn't have external dependencies and that is easy to copy-paste and use during the coding interview if allowed by the interviewer (since many data structures in JS are missing).
-
 ## References
 
 - [Wikipedia](https://en.wikipedia.org/wiki/Disjoint-set_data_structure)

src/data-structures/disjoint-set/README.md

@@ -58,11 +58,6 @@ Where:
 
 > In this repository, the [MaxHeap.js](./MaxHeap.js) and [MinHeap.js](./MinHeap.js) are examples of the **Binary** heap.
 
-## Implementation
-
-- [MaxHeap.js](./MaxHeap.js) and [MinHeap.js](./MinHeap.js)
-- [MaxHeapAdhoc.js](./MaxHeapAdhoc.js) and [MinHeapAdhoc.js](./MinHeapAdhoc.js) - The minimalistic (ad hoc) version of a MinHeap/MaxHeap data structure that doesn't have external dependencies and that is easy to copy-paste and use during the coding interview if allowed by the interviewer (since many data structures in JS are missing).
-
 ## References
 
 - [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))