From 11bf8cf89d9f2384abec5507f09551c12e246ce7 Mon Sep 17 00:00:00 2001
From: NehaKeshan <39170739+NehaKeshan@users.noreply.github.com>
Date: Tue, 2 Apr 2024 11:33:07 -0400
Subject: [PATCH 1/3] Update README.md

---
 lectures/21_trees_IV/README.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/lectures/21_trees_IV/README.md b/lectures/21_trees_IV/README.md
index 28ed839..cf248aa 100644
--- a/lectures/21_trees_IV/README.md
+++ b/lectures/21_trees_IV/README.md
@@ -1,7 +1,7 @@
 
 # Lecture 21 --- Trees, Part IV
 
-Review from Lecture 19
+Review from Lecture 20
 - Breadth-first and depth-first tree search
 - Increement/decrement operator
 - Tree height, longest-shortest paths, breadth-first search
@@ -77,7 +77,9 @@ Which nodes are red?
 
 ## 21.3 Trinary Tree
 
-A  **trinary tree** is similar to a binary tree except that each node has at most 3 children.  Write a **recursive** function named **EqualsChildrenSum** that takes one argument, a pointer to the root of a trinary tree, and returns true if the value at each non-leaf node is the sum of the values of all of its children and false otherwise.  In
+A  **trinary tree** is similar to a binary tree except that each node has at most 3 children.  
+
+Write a **recursive** function named **EqualsChildrenSum** that takes one argument, a pointer to the root of a trinary tree, and returns true if the value at each non-leaf node is the sum of the values of all of its children and false otherwise.  In
 the examples below, the tree on the left will return true and the tree on the right will return false.
 
 ```cpp

From 7c3abb45c601ecb329958115af8f3851551ce417 Mon Sep 17 00:00:00 2001
From: NehaKeshan <39170739+NehaKeshan@users.noreply.github.com>
Date: Tue, 2 Apr 2024 11:34:20 -0400
Subject: [PATCH 2/3] Update README.md

---
 lectures/22_trees_V/README.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/lectures/22_trees_V/README.md b/lectures/22_trees_V/README.md
index 1ce6d49..be49374 100644
--- a/lectures/22_trees_V/README.md
+++ b/lectures/22_trees_V/README.md
@@ -18,7 +18,11 @@
 - Going in to the test, you should know what big topics will be covered on the test. As you skim through the problems, see if you can match up those big topics to each question. Even if you are atimped about how to solve the whole problem, or some of the details of the problem, make sure you demonstrate your understanding of the big topic that is covered in that question.
 - Re-read the problem statement carefullt. Make sure you didn't miss anything.
 
-Today's lecture:
+# Review from Lecture 21
+- Red Black tree
+- B+ Trees
+
+# Today's lecture:
 - Exercises
 - Problen Solving Techniques
 

From ea8824668866131c6faf729d80cfd288fda27852 Mon Sep 17 00:00:00 2001
From: NehaKeshan <39170739+NehaKeshan@users.noreply.github.com>
Date: Tue, 2 Apr 2024 11:35:12 -0400
Subject: [PATCH 3/3] Update README.md

---
 lectures/22_trees_V/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lectures/22_trees_V/README.md b/lectures/22_trees_V/README.md
index be49374..86c158a 100644
--- a/lectures/22_trees_V/README.md
+++ b/lectures/22_trees_V/README.md
@@ -1,4 +1,4 @@
-# Lecture 22 --- Trees, Part V + Problem Solving Techniques
+# Lecture 22 --- Trees, Part V plus bonus lecture on Problem Solving Techniques
 
 ## Test 3 Information