Minor fix

sanjarcode · sanjarcode · commit f009e63ac2e1 · 2024-11-06T23:59:21.000+05:30
diff --git a/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/3._Auxilary_Data_Structures/1._Priority_Queue_and_Heap/0_index.md b/home/4_resource_itineraries/2_CN_Data_Structures_and_OOP/5._Data_Structures/3._Auxilary_Data_Structures/1._Priority_Queue_and_Heap/0_index.md
@@ -5,6 +5,6 @@ Created Wednesday 12 February 2020
 
 Use of heap:
 - Largest/smallest seen until now in logn time.
-- Kth largest/smallest element
-- First K largest/smallest elements collect
+- Kth largest/smallest element.
+- First K largest/smallest elements collect. For collection, use opposite nature heap.
 - Can replace sorting for many problems
