diff --git a/lectures/19_trees_III/README.md b/lectures/19_trees_III/README.md
index 6918fd6..0c2a6f0 100644
--- a/lectures/19_trees_III/README.md
+++ b/lectures/19_trees_III/README.md
@@ -1,5 +1,9 @@
 # Lecture 19 --- Trees, Part III
 
+## Announcements
+
+- Homework Deadline requests can only be made upto 4hrs before the deadline and for specific reasons only through an email to ds_instructors@cs.rpi.edu
+
 Review from Lecture 17 & 18
 - Overview of the ds_set implementation
 - begin, find, destroy_tree, insert
@@ -10,6 +14,9 @@ of pointers to the iterator.
 
 ## Today’s Lecture
 
+- Trivia 1
+- Submini Poll from Lecture 18
+
 - Last piece of ds_set: removing an item, erase
 - Breadth-first and depth-first tree search
 - Tree height, longest-shortest paths, breadth-first search