update heap complexities

Author: savolla

02-heap/heapsort.cpp

@@ -1,14 +1,3 @@
-/**
- * @file heapsort.cpp
- *
- * @brief this file contians source code for heap sort
- *
- * @author Oleksiy Nehlyadyuk
- * Contact: [email protected]
- *
- */
-#include "./heapsort.h"
-
 // hack for descending sort
 void negateArray(int A[], int n) {
   for (int i=0; i<n; ++i){
@@ -31,10 +20,11 @@ void maxHeapify(int A[], int n, int i) {
   }
 }
 
-// take an ordinary array and convert into heap
+// convert array into heap
 void buildMaxHeap(int A[], int n) {
-  for (int i = n / 2 - 1; i >= 0; i--)
+  for (int i = n/2-1; i >= 0; i--) {
     maxHeapify(A, n, i);
+  }
 }
 
 // sort elements in Ascending order

03-binary-search-tree/bs-tree-v2.cpp

@@ -5,10 +5,8 @@
 
 ### what is it
 
-A binary search tree is a tree data structure where:
+a binary tree where the smallest value is always on the top. used to implement a ***priority queue** or **heap sort**
 
--   The nodes to the left are smaller than the current node.
--   The nodes to the right are larger than the current node.
 ### costs
 
 <table border="2" cellspacing="0" cellpadding="6" rules="groups" frame="hsides">
@@ -23,45 +21,45 @@ A binary search tree is a tree data structure where:
 </colgroup>
 <thead>
 <tr>
-<th scope="col" class="org-left">BST</th>
-<th scope="col" class="org-left">avarage</th>
+<th scope="col" class="org-left">Heap</th>
 <th scope="col" class="org-left">worst</th>
 </tr>
 </thead>
 
 <tbody>
 <tr>
-<td class="org-left">Access</td>
-<td class="org-left">O(log(n))</td>
-<td class="org-left">O(n)</td>
+<td class="org-left">Get Min</td>
+<td class="org-left">O(1)</td>
 </tr>
 
 
 <tr>
-<td class="org-left">Search</td>
+<td class="org-left">Remove Min</td>
 <td class="org-left">O(log(n))</td>
-<td class="org-left">O(n)</td>
 </tr>
 
 
 <tr>
 <td class="org-left">Insertion</td>
 <td class="org-left">O(log(n))</td>
-<td class="org-left">O(n)</td>
 </tr>
 
 
 <tr>
-<td class="org-left">Deletion</td>
-<td class="org-left">O(log(n))</td>
+<td class="org-left">Heapsort</td>
+<td class="org-left">O(n*log(n))</td>
+</tr>
+
+
+<tr>
+<td class="org-left">Heapify</td>
 <td class="org-left">O(n)</td>
 </tr>
 </tbody>
 
 <tbody>
 <tr>
 <td class="org-left">Space</td>
-<td class="org-left">&#xa0;</td>
 <td class="org-left">O(n)</td>
 </tr>
 </tbody>