VitorEmanuelDev · Apr 1, 2019 · May 8, 2019 · Oct 29, 2019 · Mar 13, 2020 · Apr 16, 2020
diff --git a/README.md b/README.md
@@ -61,16 +61,16 @@ Source code of **Learning JavaScript Data Structures and Algorithms** book, thir
 ## Installing and running the book examples With Node
 
 * Install [Node](https://nodejs.org)
-* Open terminal/cmd and change directoty to this project folder: `cd /Users/.../javascript-datastructures-algorithms` (Linux/Max) or `cd C:/.../javascript-datastructures-algorithms`
-* run `npm install` to install all depencies
+* Open terminal/cmd and change directory to this project folder: `cd /Users/.../javascript-datastructures-algorithms` (Linux/Max) or `cd C:/.../javascript-datastructures-algorithms`
+* run `npm install` to install all dependencies
 * To see the examples, run `http-server html` or `npm run serve`. Open your browser `http:\\localhost:8080` to see the book examples
 * Or `cd html/chapter01` and run each javascript file with node: `node 02-Variables`
 
 ## Running the examples in the browser
 
 * Right click on the html file you would like to see the examples, right click and 'Open with Chrome (or any other browser)'
 
-* Or open the `examples/index.html` file to easily nagivate through all examples:
+* Or open the `examples/index.html` file to easily navigate through all examples:
 
 * Demo: [https://javascript-ds-algorithms-book.firebaseapp.com](https://javascript-ds-algorithms-book.firebaseapp.com)
 

diff --git a/examples/chapter10/01-UsingMinHeap.html b/examples/chapter10/01-UsingMinHeap.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-UsingMinHeap.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/01-UsingMinHeap.js b/examples/chapter10/01-UsingMinHeap.js
@@ -0,0 +1,27 @@
+const { MinHeap } = PacktDataStructuresAlgorithms;
+
+let heap = new MinHeap();
+
+heap.insert(2);
+heap.insert(3);
+heap.insert(4);
+heap.insert(5);
+
+heap.insert(2);
+
+console.log(heap.getAsArray());
+
+console.log('Heap size: ', heap.size()); // 5
+console.log('Heap is empty: ', heap.isEmpty()); // false
+console.log('Heap min value: ', heap.findMinimum()); // 1
+
+heap = new MinHeap();
+for (let i = 1; i < 10; i++) {
+  heap.insert(i);
+}
+
+console.log(heap.getAsArray());
+
+console.log('Extract minimum: ', heap.extract()); // 1
+console.log(heap.getAsArray()); // [2, 4, 3, 8, 5, 6, 7, 9]
+
diff --git a/examples/chapter10/02-UsingMaxHeap.html b/examples/chapter10/02-UsingMaxHeap.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="02-UsingMaxHeap.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/02-UsingMaxHeap.js b/examples/chapter10/02-UsingMaxHeap.js
@@ -0,0 +1,27 @@
+const { MaxHeap } = PacktDataStructuresAlgorithms;
+
+const maxHeap = new MaxHeap();
+
+maxHeap.insert(2);
+maxHeap.insert(3);
+maxHeap.insert(4);
+maxHeap.insert(5);
+
+maxHeap.insert(1);
+
+console.log(maxHeap.getAsArray());
+
+console.log('Heap size: ', maxHeap.size()); // 5
+console.log('Heap is empty: ', maxHeap.isEmpty()); // false
+console.log('Heap min value: ', maxHeap.findMinimum()); // 5
+
+maxHeap.insert(6);
+maxHeap.insert(9);
+maxHeap.insert(10);
+maxHeap.insert(14);
+
+console.log(maxHeap.getAsArray());
+
+console.log('Extract minimum: ', maxHeap.extract());
+console.log(maxHeap.getAsArray());
+
diff --git a/examples/chapter10/03-HeapSort.html b/examples/chapter10/03-HeapSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="03-HeapSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter10/03-HeapSort.js b/examples/chapter10/03-HeapSort.js
@@ -0,0 +1,7 @@
+const { heapSort } = PacktDataStructuresAlgorithms;
+
+console.log('********** Heap Sort **********');
+const array = [7, 6, 3, 5, 4, 1, 2];
+
+console.log('Before sorting: ', array);
+console.log('After sorting: ', heapSort(array));
diff --git a/examples/index.html b/examples/index.html
@@ -194,15 +194,18 @@
         </div>
       </section>
       <section class="mdl-layout__tab-panel" id="scroll-tab-10">
-          <div class="page-content">
-            <div class="page-content mdl-layout--fixed-drawer">
-              <div class="mdl-layout__drawer is-visible">
-                <nav class="mdl-navigation">
-                </nav>
-              </div>
+        <div class="page-content">
+          <div class="page-content mdl-layout--fixed-drawer">
+            <div class="mdl-layout__drawer is-visible">
+              <nav class="mdl-navigation">
+                <a class="mdl-navigation__link" href="chapter10/01-UsingMinHeap.html">01-UsingMinHeap</a>
+                <a class="mdl-navigation__link" href="chapter10/02-UsingMaxHeap.html">02-UsingMaxHeap</a>
+                <a class="mdl-navigation__link" href="chapter10/03-HeapSort.html">03-HeapSort</a>
+              </nav>
             </div>
           </div>
-        </section>
+        </div>
+      </section>
       <section class="mdl-layout__tab-panel" id="scroll-tab-11">
         <div class="page-content">
           <div class="page-content mdl-layout--fixed-drawer">