- Heap
- By default Java Priority Queue is Min heap
- time_complexity for creation of tree is n log n
- For largest element use Min heap and vice versa for Kth Largest element
- Create a min heap of size k
- Check if current element is greater than root node if yes of matching and push it, replace min node with replaced element.
- K closest elements:
- the difference of values should not be much.
- Streaming data use Heap, 99.9% of times uses heap.
- Sorting takes n log n time, help will take log n
- median is middle number for odd number of elements and sum of mid two for odd number of elements