Heap

Author: soumyadip007

Tree/Heap.ipynb

@@ -0,0 +1,135 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Removing node with two children....\n",
+      "Removing a leaf node...\n",
+      "5 \n",
+      "13 \n",
+      "14 \n"
+     ]
+    }
+   ],
+   "source": [
+    "\n",
+    "class Heap(object):\n",
+    "\n",
+    "    HEAP_SIZE = 10\n",
+    "\n",
+    "    def __init__(self):\n",
+    "        self.heap = [0]*Heap.HEAP_SIZE;\n",
+    "        self.currentPosition = -1;\n",
+    "\n",
+    "    def insert(self, item):\n",
+    "\n",
+    "        if self.isFull():\n",
+    "            print(\"Heap is full..\");\n",
+    "            return \n",
+    "    \n",
+    "        self.currentPosition = self.currentPosition + 1\n",
+    "        self.heap[self.currentPosition] = item\n",
+    "        self.fixUp(self.currentPosition)\n",
+    "        \n",
+    "    def fixUp(self, index):\n",
+    "\n",
+    "        parentIndex = int((index-1)/2)\n",
+    "\n",
+    "        while parentIndex >= 0 and self.heap[parentIndex] < self.heap[index]:\n",
+    "            temp = self.heap[index]\n",
+    "            self.heap[index] = self.heap[parentIndex]\n",
+    "            self.heap[parentIndex] = temp\n",
+    "            index=parentIndex\n",
+    "            parentIndex = (int)((index-1)/2)\n",
+    "\n",
+    "    def heapsort(self):\n",
+    "\n",
+    "        for i in range(0,self.currentPosition+1):\n",
+    "            temp = self.heap[0]\n",
+    "            print(\"%d \" % temp)\n",
+    "            self.heap[0] = self.heap[self.currentPosition-i]\n",
+    "            self.heap[self.currentPosition-i] = temp\n",
+    "            self.fixDown(0,self.currentPosition-i-1)\n",
+    "\n",
+    "    def fixDown(self, index, upto):\n",
+    "\n",
+    "\t\twhile index <= upto:\n",
+    "\t\t\n",
+    "\t\t\tleftChild = 2*index+1\n",
+    "\t\t\trightChild = 2*index+2\n",
+    "\t\n",
+    "\t\t\tif leftChild < upto:\n",
+    "\t\t\t\tchildToSwap = None\n",
+    "\t\t\t\t\n",
+    "\t\t\t\tif rightChild > upto:\n",
+    "\t\t\t\t\tchildToSwap = leftChild\n",
+    "\t\t\t\telse:\n",
+    "\t\t\t\t\tif self.heap[leftChild] > self.heap[rightChild]:\n",
+    "\t\t\t\t\t\tchildToSwap = leftChild\n",
+    "\t\t\t\t\telse:\n",
+    "\t\t\t\t\t\tchildToSwap = rightChild\n",
+    "\t\t\t\t\n",
+    "\t\t\t\tif self.heap[index] < self.heap[childToSwap]:\n",
+    "\t\t\t\t\ttemp = self.heap[index]\n",
+    "\t\t\t\t\tself.heap[index] = self.heap[childToSwap]\n",
+    "\t\t\t\t\tself.heap[childToSwap] = temp\n",
+    "\t\t\t\telse:\n",
+    "\t\t\t\t\tbreak\n",
+    "\t\t\t\t\n",
+    "\t\t\t\tindex = childToSwap\n",
+    "\t\t\telse:\n",
+    "\t\t\t\tbreak;\t\t\t\t\t\t\t\n",
+    "\t\t\t\n",
+    "\tdef isFull(self):\n",
+    "\t\tif self.currentPosition == Heap.HEAP_SIZE:\n",
+    "\t\t\treturn True\n",
+    "\t\telse:\n",
+    "\t\t\treturn False\n",
+    "\t\t\t\n",
+    "\t\t\t\n",
+    "if __name__ == \"__main__\":\n",
+    "\n",
+    "\theap = Heap()\n",
+    "\theap.insert(10)\n",
+    "\theap.insert(-20)\n",
+    "\theap.insert(0)\n",
+    "\theap.insert(2)\n",
+    "\theap.insert(4)\n",
+    "\theap.insert(5)\n",
+    "\theap.insert(6)\n",
+    "\theap.insert(7)\n",
+    "\theap.insert(20)\n",
+    "\theap.insert(15)\n",
+    "\t\n",
+    "\theap.heapsort()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.7.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 4
+}