Adding elements of solution for exam #2$

Author: Clément

source/code/projects/PQueue_heap/PQueue/Program.cs

@@ -46,5 +46,23 @@ static void Main(string[] args)
     Console.WriteLine(myQueue);
     myQueue.Add(1, "Cardiac arrest");
     Console.WriteLine(myQueue);
-  }
+
+        PQueue<int, string> heapProblem = new PQueue<int, string>(6);
+        heapProblem.Add(10, null);
+        Console.WriteLine(heapProblem);
+        heapProblem.Add(2, null);
+        Console.WriteLine(heapProblem);
+        heapProblem.Add(5, null);
+        Console.WriteLine(heapProblem);
+        heapProblem.Add(7, null);
+        Console.WriteLine(heapProblem);
+        heapProblem.Extract();
+        Console.WriteLine(heapProblem);
+        heapProblem.Add(3, null);
+        Console.WriteLine(heapProblem);
+        heapProblem.Add(12, null);
+        Console.WriteLine(heapProblem);
+
+
+    }
 }

source/diag/gra/bstree_example_11.txt

@@ -0,0 +1,8 @@
+%%% 
+
+A((10))-->B((8))
+A-->C((15))
+B~~~H1:::hidden
+B-->D((9))
+C-->E((13))
+C-->F((25))

source/diag/gra/bstree_example_complete.txt

@@ -0,0 +1,6 @@
+A((10))-->B((8))
+A-->C((12))
+B-->D((7))
+B-->E((9))
+C-->F((11))
+C-->G((13))

source/solutions/data/queues.md

@@ -36,3 +36,69 @@ tags:
     <summary>Solution</summary>
     We get: (end ->) 30 ; 20 (<- front).
     </details>
+
+## Problem
+
+#. This problem is about min-priority queue, i.e., queues where the most important element is the one with the lowest priority. Draw the priority queue after
+    
+    #. Inserting values with priority 10, 2, 5, 7,
+    #. Removing the most important element,
+    #. Inserting values with priority 3, 12,
+    
+    (you can either draw the queue after each step, or only at the very end)      
+    
+    #. If the queue is implemented using an array.
+    
+        <details>
+        <summary>Solution</summary>
+        
+        This is supposing an implementation [like the one shared in class](./lectures/data/priority_queue#using-arrays).      
+        We decompose each step:
+        
+        1. Insert value with priority 10
+        2. Insert value with priority 2
+        3. Insert value with priority 5
+        4. Insert value with priority 7
+        5. Remove value with priority 2 (the lowest in the queue)
+        6. Insert value with priority 3
+        7. Insert value with priority 12
+        
+        <summary>Solution</summary>
+        Step  \\ Index | 0      | 1      | 2      | 3      | 4      | 5      | 
+          :---        | ---    | ---    | ---    | ---    | ---    | ---    |   
+           1          | 10    | `null` | `null` | `null` | `null` | `null` |
+           2          | 10    |  2     | `null` | `null` | `null` | `null` | 
+           3          | 10    |  2     | 5      | `null` | `null` | `null` |
+           4          | 10    |  2     | 5      | 7      | `null` | `null` | 
+           5          | 10    | `null` | 5      | 7      | `null` | `null` |  
+           6          | 10    | 3      | 5      | 7      | `null` | `null` |
+           7          | 10    | 3      | 5      | 7      | 12     | `null` |       
+        </details>    
+    
+    #. If the queue is implemented using a binary heap.
+    
+        <details>
+        <summary>Solution</summary>
+        
+        This is supposing an implementation [like the one shared in class](./lectures/data/priority_queue#using-heaps).      
+        We decompose each step:
+        
+        1. Insert value with priority 10
+        2. Insert value with priority 2
+        3. Insert value with priority 5
+        4. Insert value with priority 7
+        5. Remove value with priority 2 (the lowest in the queue)
+        6. Insert value with priority 3
+        7. Insert value with priority 12
+        
+        <summary>Solution</summary>
+        Step  \\ Index | 0       | 1      | 2      | 3      | 4      | 5      | 
+          :---        | ---    | ---    | ---    | ---    | ---    | ---    |   
+           1           | 10      | `null` | `null` | `null` | `null` | `null` |  
+           2           | 2       | 10     | `null` | `null` | `null` | `null` | 
+           3           | 2       | 10     | 5      | `null` | `null` | `null` |
+           4           | 2       | 7      | 5      | 10     | `null` | `null` | 
+           5           | 5       | 7      | 10     | `null` | `null` | `null` | 
+           6           | 3       | 5      | 10     | 7      | `null` | `null` |
+           7           | 3       | 5      | 10     | 7      | 12     | `null` |      
+        </details>