pearcej · pearcej · Aug 6, 2026 · Aug 5, 2026
diff --git a/pretext/Trees/AVLTreeImplementation.ptx b/pretext/Trees/AVLTreeImplementation.ptx
@@ -520,4 +520,7 @@ void rebalance(TreeNode *node){
 
     </exercise>
 </reading-questions>
+    <conclusion><p>
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/AVLTreePerformance.ptx b/pretext/Trees/AVLTreePerformance.ptx
@@ -90,4 +90,7 @@
             equal to a constant(1.44) times the log of the number of nodes in the tree. This
             is great news for searching our AVL tree because it limits the search to
             <m>O(\log{N})</m>.</p>
+    <conclusion><p>
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/BalancedBinarySearchTrees.ptx b/pretext/Trees/BalancedBinarySearchTrees.ptx
@@ -41,4 +41,7 @@
 
         </image>
         </figure>
+    <conclusion><p>
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/BinaryHeapImplementation.ptx b/pretext/Trees/BinaryHeapImplementation.ptx
@@ -577,4 +577,7 @@ main()
             <statement>
     <p>What is the vector used in the binary tree in the first image of <xref ref="binheap_fig-percdown"/>? Exclude any whitespace. <var/>  </p></statement><setup><var><condition string="^\s*0,9,14,11,17,18,19,21,33,27\s*$"><feedback><p>Is the correct answer!</p></feedback></condition><condition string="^\s*.*9,14,11,17,18,19,21,33,27\s*$"><feedback><p>Remember what has to be at the beginning of the vector to accurately traverse through the binary tree. Look back at chp. 8.9.2.</p></feedback></condition><condition string="^\s*.*\s*$"><feedback><p>Refer to section 8.10.1 and 8.10.2</p></feedback></condition></var></setup></exercise> </reading-questions>
 </subsection>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/BinaryHeapOperations.ptx b/pretext/Trees/BinaryHeapOperations.ptx
@@ -239,4 +239,7 @@ main()
                 </code></program></statement>
             </task>
         </exploration>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
 </section>
diff --git a/pretext/Trees/BinaryHeapPriorityQExample.ptx b/pretext/Trees/BinaryHeapPriorityQExample.ptx
@@ -23,5 +23,8 @@
                 </image>
             </figure>
         <p>As we continue to complete the homework with the closest deadline we will continue to remove the homeworks in the demostrated fashion until we are done.</p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/BinarySearchTrees.ptx b/pretext/Trees/BinarySearchTrees.ptx
@@ -8,5 +8,8 @@
             case we are not interested in the exact placement of items in the tree,
             but we are interested in using the binary tree structure to provide for
             efficient searching.</p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/DiscussionQuestions.ptx b/pretext/Trees/DiscussionQuestions.ptx
@@ -106,5 +106,8 @@
                 </figure>
             </li>
         </ol></p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/ExamplesofTrees.ptx b/pretext/Trees/ExamplesofTrees.ptx
@@ -159,5 +159,8 @@
 
     </exercise>
 </reading-questions>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/Glossary.ptx b/pretext/Trees/Glossary.ptx
@@ -186,5 +186,8 @@
                 </gi>
 
         </glossary>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/ListofListsRepresentation.ptx b/pretext/Trees/ListofListsRepresentation.ptx
@@ -237,4 +237,7 @@ main()
     </statement>
 </exercise>
         </note>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/Matching.ptx b/pretext/Trees/Matching.ptx
@@ -83,4 +83,7 @@
       </match>
     </cardsort>
   </exercise>
+<conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
 </section>
diff --git a/pretext/Trees/NodesandReferences.ptx b/pretext/Trees/NodesandReferences.ptx
@@ -380,4 +380,7 @@ main()
 
     </exercise>
 </reading-questions>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/Objectives.ptx b/pretext/Trees/Objectives.ptx
@@ -20,5 +20,8 @@
                 <p>To implement a priority queue using a heap.</p>
             </li>
         </ul></p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/ParseTree.ptx b/pretext/Trees/ParseTree.ptx
@@ -576,5 +576,8 @@ def evaluate(parseTree):
 
     </statement>
 </exercise>
-</reading-questions> 
+</reading-questions>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/PriorityQueueswithBinaryHeaps.ptx b/pretext/Trees/PriorityQueueswithBinaryHeaps.ptx
@@ -30,5 +30,8 @@
             at the front, and the <term>max heap</term>, in which the largest key value is
             always at the front. In this section we will implement the min heap. We
             leave a max heap implementation as an exercise.</p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/ProgrammingExercises.ptx b/pretext/Trees/ProgrammingExercises.ptx
@@ -54,5 +54,8 @@
                     constructor, plus the <c>enqueue</c> and <c>dequeue</c> methods.</p>
             </li>
         </ol></p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/SearchTreeAnalysis.ptx b/pretext/Trees/SearchTreeAnalysis.ptx
@@ -73,5 +73,8 @@
         </setup>
     </exercise>
 </reading-questions>
+<conclusion><p> 
+        <!-- extra space before the progress bar -->            
+</p></conclusion>
 </section>
 
diff --git a/pretext/Trees/SearchTreeImplementation.ptx b/pretext/Trees/SearchTreeImplementation.ptx
@@ -1279,4 +1279,7 @@ main()
                 </exercise>
 
             </reading-questions>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/SearchTreeOperations.ptx b/pretext/Trees/SearchTreeOperations.ptx
@@ -26,5 +26,8 @@
                 <p><c>length()</c> Return the number of key-value pairs stored in the tree.</p>
             </li>
         </ul></p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/Summary.ptx b/pretext/Trees/Summary.ptx
@@ -17,5 +17,8 @@
                 <p>A min heap used to implement a priority queue.</p>
             </li>
         </ul></p>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/SummaryofMapADTImplementations.ptx b/pretext/Trees/SummaryofMapADTImplementations.ptx
@@ -100,5 +100,8 @@
 
 
         </tabular></table>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
 
diff --git a/pretext/Trees/TreeTraversals.ptx b/pretext/Trees/TreeTraversals.ptx
@@ -455,4 +455,7 @@ Section<nbsp/>2.1, Section<nbsp/>2.2.1, Section<nbsp/>2.2.2, Section<nbsp/>2.2,
 
     </exercise>
 </reading-questions>
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
     </section>
diff --git a/pretext/Trees/VocabularyandDefinitions.ptx b/pretext/Trees/VocabularyandDefinitions.ptx
@@ -154,4 +154,7 @@
         <response/>
     </exercise>
 </reading-questions> 
+    <conclusion><p> 
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
 </section>