Priority Queue

Author: mitghi

Priority Queue/README.md

@@ -9,8 +9,11 @@ In this case, our queue is min-priority oriented and uses Minimum Heap propertie
 Priority Queue uses an Array internally which starts at index 1.
 
 for every index in the Array:
+
  left child is index * 2
+
  right child is (index * 2) + 1
+
  parent is floor(index/2)
 
 Parents must have priority value lesser than their childs.