mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-04 00:18:02 +00:00
Add min heap challenge
This commit is contained in:
Donne Martin
0
graphs_trees/min_heap/__init__.py
Normal file
0
graphs_trees/min_heap/__init__.py
Normal file
66
graphs_trees/min_heap/min_heap.py
Normal file
66
graphs_trees/min_heap/min_heap.py
Normal file
@@ -0,0 +1,66 @@
|
||||
from __future__ import division
|
||||
|
||||
import sys
|
||||
|
||||
|
||||
class MinHeap(object):
|
||||
|
||||
def __init__(self):
|
||||
self.array = []
|
||||
|
||||
def __len__(self):
|
||||
return len(self.array)
|
||||
|
||||
def extract_min(self):
|
||||
if not self.array:
|
||||
return None
|
||||
if len(self.array) == 1:
|
||||
return self.array.pop(0)
|
||||
minimum = self.array[0]
|
||||
# Move the last element to the root
|
||||
self.array[0] = self.array.pop(-1)
|
||||
self._bubble_down(index=0)
|
||||
return minimum
|
||||
|
||||
def peek_min(self):
|
||||
return self.array[0] if self.array else None
|
||||
|
||||
def insert(self, key):
|
||||
if key is None:
|
||||
raise TypeError('key cannot be None')
|
||||
self.array.append(key)
|
||||
self._bubble_up(index=len(self.array)-1)
|
||||
|
||||
def _bubble_up(self, index):
|
||||
if index == 0:
|
||||
return
|
||||
index_parent = (index-1) // 2
|
||||
if self.array[index] < self.array[index_parent]:
|
||||
# Swap the indices and recurse
|
||||
self.array[index], self.array[index_parent] = \
|
||||
self.array[index_parent], self.array[index]
|
||||
self._bubble_up(index_parent)
|
||||
|
||||
def _bubble_down(self, index):
|
||||
min_child_index = self._find_smaller_child(index)
|
||||
if min_child_index == -1:
|
||||
return
|
||||
if self.array[index] > self.array[min_child_index]:
|
||||
# Swap the indices and recurse
|
||||
self.array[index], self.array[min_child_index] = \
|
||||
self.array[min_child_index], self.array[index]
|
||||
self._bubble_down(min_child_index)
|
||||
|
||||
def _find_smaller_child(self, index):
|
||||
left_child_index = 2 * index + 1
|
||||
right_child_index = 2 * index + 2
|
||||
if right_child_index >= len(self.array):
|
||||
if left_child_index >= len(self.array):
|
||||
return -1
|
||||
else:
|
||||
return left_child_index
|
||||
else:
|
||||
if self.array[left_child_index] < self.array[right_child_index]:
|
||||
return left_child_index
|
||||
else:
|
||||
return right_child_index
|
||||
214
graphs_trees/min_heap/min_heap_challenge.ipynb
Normal file
214
graphs_trees/min_heap/min_heap_challenge.ipynb
Normal file
@@ -0,0 +1,214 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"This notebook was prepared by [Donne Martin](https://github.com/donnemartin). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges)."
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"# Challenge Notebook"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement a min heap with extract_min and insert methods.\n",
|
||||
"\n",
|
||||
"* [Constraints](#Constraints)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)\n",
|
||||
"* [Solution Notebook](#Solution-Notebook)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints\n",
|
||||
"\n",
|
||||
"* Can we assume the inputs are ints?\n",
|
||||
" * Yes\n",
|
||||
"* Can we assume this fits memory?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Extract min of an empty tree\n",
|
||||
"* Extract min general case\n",
|
||||
"* Insert into an empty tree\n",
|
||||
"* Insert general case (left and right insert)\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25\n",
|
||||
" \n",
|
||||
"extract_min(): 5\n",
|
||||
"\n",
|
||||
" _15_\n",
|
||||
" / \\\n",
|
||||
" 20 25\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 \n",
|
||||
"\n",
|
||||
"insert(2):\n",
|
||||
"\n",
|
||||
" _2_\n",
|
||||
" / \\\n",
|
||||
" 20 5\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25 15\n",
|
||||
"</pre>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/min_heap/min_heap_solution.ipynb). If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start."
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": null,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"class MinHeap(object):\n",
|
||||
"\n",
|
||||
" def __init__(self):\n",
|
||||
" # TODO: Implement me\n",
|
||||
" pass\n",
|
||||
"\n",
|
||||
" def extract_min(self):\n",
|
||||
" # TODO: Implement me\n",
|
||||
" pass \n",
|
||||
"\n",
|
||||
" def peek_min(self):\n",
|
||||
" # TODO: Implement me\n",
|
||||
" pass\n",
|
||||
"\n",
|
||||
" def insert(self, data):\n",
|
||||
" # TODO: Implement me\n",
|
||||
" pass\n",
|
||||
"\n",
|
||||
" def _bubble_up(self, index):\n",
|
||||
" # TODO: Implement me\n",
|
||||
" pass"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"**The following unit test is expected to fail until you solve the challenge.**"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": null,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"# %load test_min_heap.py\n",
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"class TestMinHeap(object):\n",
|
||||
"\n",
|
||||
" def test_min_heap(self):\n",
|
||||
" heap = MinHeap()\n",
|
||||
" assert_equal(heap.peek_min(), None)\n",
|
||||
" assert_equal(heap.extract_min(), None)\n",
|
||||
" heap.insert(20)\n",
|
||||
" assert_equal(heap.peek_min(), 20)\n",
|
||||
" heap.insert(5)\n",
|
||||
" assert_equal(heap.peek_min(), 5)\n",
|
||||
" heap.insert(15)\n",
|
||||
" heap.insert(22)\n",
|
||||
" heap.insert(40)\n",
|
||||
" heap.insert(5)\n",
|
||||
" assert_equal(heap.peek_min(), 5)\n",
|
||||
" heap.insert(3)\n",
|
||||
" assert_equal(heap.peek_min(), 3)\n",
|
||||
" assert_equal(heap.extract_min(), 3)\n",
|
||||
" assert_equal(heap.peek_min(), 5)\n",
|
||||
" print('Success: test_min_heap')\n",
|
||||
"\n",
|
||||
" \n",
|
||||
"def main():\n",
|
||||
" test = TestMinHeap()\n",
|
||||
" test.test_min_heap()\n",
|
||||
"\n",
|
||||
" \n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" main()"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Solution Notebook\n",
|
||||
"\n",
|
||||
"Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/min_heap/min_heap_solution.ipynb) for a discussion on algorithms and code solutions."
|
||||
]
|
||||
}
|
||||
],
|
||||
"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.5.0"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
411
graphs_trees/min_heap/min_heap_solution.ipynb
Normal file
411
graphs_trees/min_heap/min_heap_solution.ipynb
Normal file
@@ -0,0 +1,411 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"This notebook was prepared by [Donne Martin](https://github.com/donnemartin). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges)."
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"# Solution Notebook"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Implement a min heap with extract_min and insert methods.\n",
|
||||
"\n",
|
||||
"* [Constraints](#Constraints)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints\n",
|
||||
"\n",
|
||||
"* Can we assume the inputs are ints?\n",
|
||||
" * Yes\n",
|
||||
"* Can we assume this fits memory?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"* Extract min of an empty tree\n",
|
||||
"* Extract min general case\n",
|
||||
"* Insert into an empty tree\n",
|
||||
"* Insert general case (left and right insert)\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25\n",
|
||||
" \n",
|
||||
"extract_min(): 5\n",
|
||||
"\n",
|
||||
" _15_\n",
|
||||
" / \\\n",
|
||||
" 20 25\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 \n",
|
||||
"\n",
|
||||
"insert(2):\n",
|
||||
"\n",
|
||||
" _2_\n",
|
||||
" / \\\n",
|
||||
" 20 5\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25 15\n",
|
||||
"</pre>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"A heap is a complete binary tree where each node is smaller than its children.\n",
|
||||
"\n",
|
||||
"### extract_min\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25\n",
|
||||
"\n",
|
||||
"Save the root as the value to be returned: 5\n",
|
||||
"Move the right most element to the root: 25\n",
|
||||
"\n",
|
||||
" _25_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 \n",
|
||||
"\n",
|
||||
"Bubble down 25: Swap 25 and 15 (the smaller child)\n",
|
||||
"\n",
|
||||
" _15_\n",
|
||||
" / \\\n",
|
||||
" 20 25\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 \n",
|
||||
"\n",
|
||||
"Return 5\n",
|
||||
"</pre>\n",
|
||||
"\n",
|
||||
"We'll use an array to represent the tree, here are the indices:\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _0_\n",
|
||||
" / \\\n",
|
||||
" 1 2\n",
|
||||
" / \\ / \\\n",
|
||||
" 3 4 \n",
|
||||
"</pre>\n",
|
||||
"\n",
|
||||
"To get to a child, we take 2 * index + 1 (left child) or 2 * index + 2 (right child).\n",
|
||||
"\n",
|
||||
"For example, the right child of index 1 is 2 * 1 + 2 = 4.\n",
|
||||
"\n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(lg(n))\n",
|
||||
"* Space: O(lg(n)) for the recursion depth (tree height), or O(1) if using an iterative approach\n",
|
||||
"\n",
|
||||
"### insert\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25\n",
|
||||
"\n",
|
||||
"insert(2):\n",
|
||||
"Insert at the right-most spot to maintain the heap property.\n",
|
||||
"\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 15\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25 2\n",
|
||||
"\n",
|
||||
"Bubble up 2: Swap 2 and 15\n",
|
||||
"\n",
|
||||
" _5_\n",
|
||||
" / \\\n",
|
||||
" 20 2\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25 15\n",
|
||||
"\n",
|
||||
"Bubble up 2: Swap 2 and 5\n",
|
||||
"\n",
|
||||
" _2_\n",
|
||||
" / \\\n",
|
||||
" 20 5\n",
|
||||
" / \\ / \\\n",
|
||||
" 22 40 25 15\n",
|
||||
"</pre>\n",
|
||||
"\n",
|
||||
"We'll use an array to represent the tree, here are the indices:\n",
|
||||
"\n",
|
||||
"<pre>\n",
|
||||
" _0_\n",
|
||||
" / \\\n",
|
||||
" 1 2\n",
|
||||
" / \\ / \\\n",
|
||||
" 3 4 5 6\n",
|
||||
"</pre>\n",
|
||||
"\n",
|
||||
"To get to a parent, we take (index - 1) // 2. \n",
|
||||
"\n",
|
||||
"For example, the parent of index 6 is (6 - 1) // 2 = 2.\n",
|
||||
"\n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(lg(n))\n",
|
||||
"* Space: O(lg(n)) for the recursion depth (tree height), or O(1) if using an iterative approach"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Code"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Overwriting min_heap.py\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"%%writefile min_heap.py\n",
|
||||
"from __future__ import division\n",
|
||||
"\n",
|
||||
"import sys\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"class MinHeap(object):\n",
|
||||
"\n",
|
||||
" def __init__(self):\n",
|
||||
" self.array = []\n",
|
||||
"\n",
|
||||
" def __len__(self):\n",
|
||||
" return len(self.array)\n",
|
||||
"\n",
|
||||
" def extract_min(self):\n",
|
||||
" if not self.array:\n",
|
||||
" return None\n",
|
||||
" if len(self.array) == 1:\n",
|
||||
" return self.array.pop(0)\n",
|
||||
" minimum = self.array[0]\n",
|
||||
" # Move the last element to the root\n",
|
||||
" self.array[0] = self.array.pop(-1)\n",
|
||||
" self._bubble_down(index=0)\n",
|
||||
" return minimum\n",
|
||||
"\n",
|
||||
" def peek_min(self):\n",
|
||||
" return self.array[0] if self.array else None\n",
|
||||
"\n",
|
||||
" def insert(self, key):\n",
|
||||
" if key is None:\n",
|
||||
" raise TypeError('key cannot be None')\n",
|
||||
" self.array.append(key)\n",
|
||||
" self._bubble_up(index=len(self.array) - 1)\n",
|
||||
"\n",
|
||||
" def _bubble_up(self, index):\n",
|
||||
" if index == 0:\n",
|
||||
" return\n",
|
||||
" index_parent = (index - 1) // 2\n",
|
||||
" if self.array[index] < self.array[index_parent]:\n",
|
||||
" # Swap the indices and recurse\n",
|
||||
" self.array[index], self.array[index_parent] = \\\n",
|
||||
" self.array[index_parent], self.array[index]\n",
|
||||
" self._bubble_up(index_parent)\n",
|
||||
"\n",
|
||||
" def _bubble_down(self, index):\n",
|
||||
" min_child_index = self._find_smaller_child(index)\n",
|
||||
" if min_child_index == -1:\n",
|
||||
" return\n",
|
||||
" if self.array[index] > self.array[min_child_index]:\n",
|
||||
" # Swap the indices and recurse\n",
|
||||
" self.array[index], self.array[min_child_index] = \\\n",
|
||||
" self.array[min_child_index], self.array[index]\n",
|
||||
" self._bubble_down(min_child_index)\n",
|
||||
"\n",
|
||||
" def _find_smaller_child(self, index):\n",
|
||||
" left_child_index = 2 * index + 1\n",
|
||||
" right_child_index = 2 * index + 2\n",
|
||||
" # No right child\n",
|
||||
" if right_child_index >= len(self.array):\n",
|
||||
" # No left child\n",
|
||||
" if left_child_index >= len(self.array):\n",
|
||||
" return -1\n",
|
||||
" # Left child only\n",
|
||||
" else:\n",
|
||||
" return left_child_index\n",
|
||||
" else:\n",
|
||||
" # Compare left and right children\n",
|
||||
" if self.array[left_child_index] < self.array[right_child_index]:\n",
|
||||
" return left_child_index\n",
|
||||
" else:\n",
|
||||
" return right_child_index"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": true
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"%run min_heap.py"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 3,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Overwriting test_min_heap.py\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"%%writefile test_min_heap.py\n",
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"class TestMinHeap(object):\n",
|
||||
"\n",
|
||||
" def test_min_heap(self):\n",
|
||||
" heap = MinHeap()\n",
|
||||
" assert_equal(heap.peek_min(), None)\n",
|
||||
" assert_equal(heap.extract_min(), None)\n",
|
||||
" heap.insert(20)\n",
|
||||
" assert_equal(heap.array[0], 20)\n",
|
||||
" heap.insert(5)\n",
|
||||
" assert_equal(heap.array[0], 5)\n",
|
||||
" assert_equal(heap.array[1], 20)\n",
|
||||
" heap.insert(15)\n",
|
||||
" assert_equal(heap.array[0], 5)\n",
|
||||
" assert_equal(heap.array[1], 20)\n",
|
||||
" assert_equal(heap.array[2], 15)\n",
|
||||
" heap.insert(22)\n",
|
||||
" assert_equal(heap.array[0], 5)\n",
|
||||
" assert_equal(heap.array[1], 20)\n",
|
||||
" assert_equal(heap.array[2], 15)\n",
|
||||
" assert_equal(heap.array[3], 22)\n",
|
||||
" heap.insert(40)\n",
|
||||
" assert_equal(heap.array[0], 5)\n",
|
||||
" assert_equal(heap.array[1], 20)\n",
|
||||
" assert_equal(heap.array[2], 15)\n",
|
||||
" assert_equal(heap.array[3], 22)\n",
|
||||
" assert_equal(heap.array[4], 40)\n",
|
||||
" heap.insert(3)\n",
|
||||
" assert_equal(heap.array[0], 3)\n",
|
||||
" assert_equal(heap.array[1], 20)\n",
|
||||
" assert_equal(heap.array[2], 5)\n",
|
||||
" assert_equal(heap.array[3], 22)\n",
|
||||
" assert_equal(heap.array[4], 40)\n",
|
||||
" assert_equal(heap.array[5], 15)\n",
|
||||
" mins = []\n",
|
||||
" while heap:\n",
|
||||
" mins.append(heap.extract_min())\n",
|
||||
" assert_equal(mins, [3, 5, 15, 20, 22, 40])\n",
|
||||
" print('Success: test_min_heap')\n",
|
||||
"\n",
|
||||
" \n",
|
||||
"def main():\n",
|
||||
" test = TestMinHeap()\n",
|
||||
" test.test_min_heap()\n",
|
||||
"\n",
|
||||
" \n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" main()"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 4,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [
|
||||
{
|
||||
"name": "stdout",
|
||||
"output_type": "stream",
|
||||
"text": [
|
||||
"Success: test_min_heap\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"%run -i test_min_heap.py"
|
||||
]
|
||||
}
|
||||
],
|
||||
"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.4.3"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
50
graphs_trees/min_heap/test_min_heap.py
Normal file
50
graphs_trees/min_heap/test_min_heap.py
Normal file
@@ -0,0 +1,50 @@
|
||||
from nose.tools import assert_equal
|
||||
|
||||
|
||||
class TestMinHeap(object):
|
||||
|
||||
def test_min_heap(self):
|
||||
heap = MinHeap()
|
||||
assert_equal(heap.peek_min(), None)
|
||||
assert_equal(heap.extract_min(), None)
|
||||
heap.insert(20)
|
||||
assert_equal(heap.array[0], 20)
|
||||
heap.insert(5)
|
||||
assert_equal(heap.array[0], 5)
|
||||
assert_equal(heap.array[1], 20)
|
||||
heap.insert(15)
|
||||
assert_equal(heap.array[0], 5)
|
||||
assert_equal(heap.array[1], 20)
|
||||
assert_equal(heap.array[2], 15)
|
||||
heap.insert(22)
|
||||
assert_equal(heap.array[0], 5)
|
||||
assert_equal(heap.array[1], 20)
|
||||
assert_equal(heap.array[2], 15)
|
||||
assert_equal(heap.array[3], 22)
|
||||
heap.insert(40)
|
||||
assert_equal(heap.array[0], 5)
|
||||
assert_equal(heap.array[1], 20)
|
||||
assert_equal(heap.array[2], 15)
|
||||
assert_equal(heap.array[3], 22)
|
||||
assert_equal(heap.array[4], 40)
|
||||
heap.insert(3)
|
||||
assert_equal(heap.array[0], 3)
|
||||
assert_equal(heap.array[1], 20)
|
||||
assert_equal(heap.array[2], 5)
|
||||
assert_equal(heap.array[3], 22)
|
||||
assert_equal(heap.array[4], 40)
|
||||
assert_equal(heap.array[5], 15)
|
||||
mins = []
|
||||
while heap:
|
||||
mins.append(heap.extract_min())
|
||||
assert_equal(mins, [3, 5, 15, 20, 22, 40])
|
||||
print('Success: test_min_heap')
|
||||
|
||||
|
||||
def main():
|
||||
test = TestMinHeap()
|
||||
test.test_min_heap()
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
main()
|
||||
Reference in New Issue
Block a user