@@ -27,6 +27,7 @@ This is an incomplete list of arguments in favor of immutability:
2727- [ Dictionary (Associative Array)] ( https://en.wikipedia.org/wiki/Associative_array )
2828- [ Set] ( https://en.wikipedia.org/wiki/Set_(abstract_data_type) )
2929- [ BinaryTree] ( https://en.wikipedia.org/wiki/Binary_tree )
30+ - [ Heap] ( https://en.wikipedia.org/wiki/Heap_(data_structure) )
3031
3132##Upcoming:
32331 . <strike > Queue </strike >
@@ -40,7 +41,7 @@ This is an incomplete list of arguments in favor of immutability:
40419 . AVLTree
414210 . BinarySearchTree
424311 . RedBlackTree
43- 12 . Heap
44+ 12 . < strike > Heap</ strike >
444513 . HashTable
454614 . <strike >Dictionary (Associative Array)</strike >
464715 . <strike >BinaryTree</strike >
@@ -117,6 +118,14 @@ tree = BinaryTree(BinaryTree(BinaryTree(None, None, 2),
117118print tree,repr (tree),13 in tree,3.14 in tree,list (tree),iter (tree), tree.add(1 ).add(2 ).remove(3 ).remove(4 )
118119```
119120
121+ ###Heap
122+ ``` python
123+ from immutable.trresimport Heap
124+
125+ h= Heap.make([1 ,2 ,3 ,4 ,5 ,6 ,10 ,14 ,11 ,0 ,- 2 ),min )# second parameter is an optional comparator, default is max.
126+ print h.add(1 ).pop(3 ).pop(4 ).add(20 ).head()
127+ ```
128+
120129& nbsp;
121130& nbsp;
122131& nbsp;