Heap code and test added

Author: shaonty

.gitignore

@@ -1 +1,2 @@
 **/__pycache__/*
+*.pyc

Data Structure/Heap/README.md

@@ -0,0 +1,77 @@
+"""MaxHeap implementation using python"""
+
+
+class MaxHeap(object):
+
+	HEAP_SIZE = 10
+
+	def __init__(self):
+		self.heap = [0]*MaxHeap.HEAP_SIZE
+		self.currentPosition = -1
+
+	def _swap(self,i,j):
+		self.heap[i], self.heap[j] = self.heap[j], self.heap[i]
+
+	def _heapIsFull(self):
+		if self.currentPosition == MaxHeap.HEAP_SIZE:
+			return True
+		return False
+
+	def insert(self, item):
+		if self._heapIsFull():
+			"Heap is full..."
+			return
+		self.currentPosition+=1
+		self.heap[self.currentPosition] = item
+		# adjust parent node item
+		self._bubbleUp(self.currentPosition)
+
+	def _bubbleUp(self, currentPosition):
+		index = currentPosition
+		parrentIndex = index//2
+
+		if parrentIndex>=0 and self.heap[parrentIndex] < self.heap[index]:
+			self._swap(parrentIndex, index)
+			# index = parrentIndex
+			self._bubbleUp(parrentIndex)
+			
+
+	def getMax(self):
+		if self.heap[0]:
+			return self.heap[0]
+		else:
+			return "Empty Heap"
+
+	def pop(self):
+		if self.currentPosition > 1:
+			# swap first element with last element
+			self._swap(0,self.currentPosition)
+			del self.heap[self.currentPosition]
+			# adjust parent node item
+			self._bubbleDown(0)
+		elif self.currentPosition == 1:
+			del self.heap[0]
+		else:
+			print "No deletion operation for empty heap"
+			return "False"
+
+	def _bubbleDown(self, index):
+		left = 2*index+1
+		right = 2*index+2
+		largest = index
+		if len(self.heap) > left and self.heap[largest] < self.heap[left]:
+			largest = left
+		if len(self.heap) > right and self.heap[largest] < self.heap[right]:
+			largest = right
+		if largest!=index:
+			self._swap(index, largest)
+			self._bubbleDown(largest)
+
+	def printHeap(self):
+		all_hp_element = []
+		for i in self.heap:
+			if i!=0:
+				all_hp_element.append(i)
+		return all_hp_element
+
+			

Data Structure/Heap/heap.py

@@ -0,0 +1,24 @@
+import unittest
+from heap import MaxHeap
+
+class MaxHeapTestCase(unittest.TestCase):
+    """ Test for Heap.py"""
+    def test(self):
+        # test data 
+        ob = MaxHeap()
+        ob.insert(10)
+        ob.insert(5)
+        ob.insert(6)
+        ob.insert(3)
+        ob.insert(8)
+        ob.insert(20)
+
+        ob.pop()
+        ob.pop()
+        
+        get_max = ob.getMax()
+        self.assertEqual(ob.printHeap(), [8, 6, 3, 5], msg="Heap Element Should be [8,6,3,5]")
+        self.assertEqual(get_max, 8, msg="Max Element is not matched")
+
+if __name__ == '__main__':
+    unittest.main()