prep-coding/adt/HeapDemo.py at master · tushar-sharma/prep-coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import heapq

def heapqDemo():
    """
    Using heap API in python
    """

    ## Min Heap

    nums = [3, 7, 9, 8, 5, 6, 1]

    print("Min heap...")

    print("nums : %s" % nums)

    heapq.heapify(nums)

    print("after heapify, nums: %s" % nums)

    print("min element is %s " %  nums[0])

    print("Extract minimum element %s" % heapq.heappop(nums))

    print("nums : %s" % nums)

    print("Extract minimum element %s" % heapq.heappop(nums))

    print("nums : %s" % nums)

    ## Max Heap

    nums = [3, 7, 9, 8, 5, 6, 1]

    print("Max heap...")

    print("nums : %s" % nums)

    heapq._heapify_max(nums)

    print("after heapify, nums: %s" % nums)

    print("max element is %s " %  nums[0])

    print("Extract maxium element %s" % heapq._heappop_max(nums))

    print("nums : %s" % nums)

    print("Extract maxium element %s" % heapq._heappop_max(nums))

    print("nums : %s" % nums)


if __name__=="__main__":
    heapqDemo()