PDC4S:\IT\JAVA All course\[Educative.io] Data Structures for Coding Interviews in Java\8.Heap | ||
 Up one directory... | ||
 | ||
 Challenge 1- Convert a Max-Heap to a Min-Heap | ||
| Challenge 2- Find the k Smallest Elements in an Array | ||
| Challenge 3- Find the k Largest Elements in an Array | ||
| Heap Interview Questions | ||
| Heap Representation in Arrays | ||
| Max Heap (Implementation) | ||
| Max Heap- Introduction | ||
| Min Heap (Implementation) | ||
| Min Heap- An Introduction | ||
| Solution Review- Convert a Max-Heap to a Min-Heap | ||
| Solution Review- Find the k Largest Elements in an Array | ||
| Solution Review- Find the k Smallest Elements in an Array | ||
| What is a Heap | ||
| Why Use Heaps_ | ||
 .DS_Store | ||