Skip to content

Commit ab3e408

Browse files
authored
Update max_heap.py
1 parent 857d09e commit ab3e408

File tree

1 file changed

+21
-24
lines changed

1 file changed

+21
-24
lines changed

data_structures/heap/max_heap.py

Lines changed: 21 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,18 @@
11
class BinaryHeap:
22
"""
33
A max-heap implementation in Python
4-
>>> sample = BinaryHeap()
5-
>>> sample.insert(6)
6-
>>> sample.insert(10)
7-
>>> sample.insert(15)
8-
>>> sample.insert(12)
9-
>>> print(sample.pop())
4+
>>> binary_heap = BinaryHeap()
5+
>>> binary_heap.insert(6)
6+
>>> binary_heap.insert(10)
7+
>>> binary_heap.insert(15)
8+
>>> binary_heap.insert(12)
9+
>>> binary_heap.pop()
1010
15
11-
>>> print(sample.pop())
11+
>>> binary_heap.pop()
1212
12
13-
>>> print(sample.get_list)
13+
>>> binary_heap.get_list
1414
[10, 6]
15-
>>> print(len(sample))
15+
>>> len(binary_heap)
1616
2
1717
"""
1818

@@ -69,22 +69,19 @@ def __len__(self):
6969
return self.__size
7070

7171

72-
# example
73-
# create an instance of BinaryHeap object
74-
sample = BinaryHeap()
75-
# insert values
76-
sample.insert(6)
77-
sample.insert(10)
78-
sample.insert(15)
79-
sample.insert(12)
80-
# pop root(max-values because it is max heap)
81-
print(sample.pop()) # 15
82-
print(sample.pop()) # 12
83-
# get the list and size after operations
84-
print(sample.get_list)
85-
print(len(sample))
86-
8772
if __name__ == "__main__":
8873
import doctest
8974

9075
doctest.testmod()
76+
# create an instance of BinaryHeap
77+
binary_heap = BinaryHeap()
78+
binary_heap.insert(6)
79+
binary_heap.insert(10)
80+
binary_heap.insert(15)
81+
binary_heap.insert(12)
82+
# pop root(max-values because it is max heap)
83+
print(binary_heap.pop()) # 15
84+
print(binary_heap.pop()) # 12
85+
# get the list and size after operations
86+
print(binary_heap.get_list)
87+
print(len(binary_heap))

0 commit comments

Comments
 (0)