Heap Data Structure

Recent articles on Heap !

Popular Articles on Heap :

  1. Binary Heap
  2. Time Complexity of building a heap
  3. Applications of Heap Data Structure
  4. Binomial Heap
  5. Fibonacci Heap
  6. Leftist Heap
  7. K-ary Heap
  8. Heap Sort
  9. Iterative Heap Sort
  10. K’th Largest Element in an array
  11. K’th Smallest/Largest Element in Unsorted Array | Set 1
  12. Sort an almost sorted array/
  13. Tournament Tree (Winner Tree) and Binary Heap
  14. Check if a given Binary Tree is Heap
  15. How to check if a given array represents a Binary Heap?
  16. Print all elements in sorted order from row and column wise sorted matrix
  17. Connect n ropes with minimum cost
  18. Design an efficient data structure for given operations
  19. Merge k sorted arrays | Set 1
  20. Merge Sort Tree for Range Order Statistics
  21. Sort numbers stored on different machines
  22. Smallest Derangement of Sequence
  23. Largest Derangement of a Sequence
  24. K maximum sum combinations from two arrays
  25. Maximum distinct elements after removing k elements
  26. Maximum difference between two subsets of m elements
  27. Height of a complete binary tree (or Heap) with N nodes
  28. Heap Sort for decreasing order using min heap
  29. Print all nodes less than a value x in a Min Heap.
  30. Median of Stream of Running Integers using STL
  31. Largest triplet product in a stream
  32. Find k numbers with most occurrences in the given array
  33. Convert BST to Min Heap
  34. Merge two binary Max Heaps
  35. K-th Largest Sum Contiguous Subarray
  36. Minimum product of k integers in an array of positive Integers
  37. Leaf starting point in a Binary Heap data structure
  38. Why is Binary Heap Preferred over BST for Priority Queue?
  39. Convert min Heap to max Heap
  40. Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap
  41. Rearrange characters in a string such that no two adjacent are same
  42. Implementation of Binomial Heap
  43. Array Representation Of Binary Heap
  44. Sum of all elements between k1’th and k2’th smallest elements
  45. Minimum sum of two numbers formed from digits of an array
  46. K’th largest element in a stream
  47. k largest(or smallest) elements in an array | added Min Heap method
  48. Median in a stream of integers (running integers)
  49. Sort a nearly sorted (or K sorted) array

Misc :

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up