diff --git a/lectures/20_trees_III/README.md b/lectures/20_trees_III/README.md
index f7f2ab2..54d7a20 100644
--- a/lectures/20_trees_III/README.md
+++ b/lectures/20_trees_III/README.md
@@ -1,9 +1,5 @@
 # Lecture 20 --- 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 18 & 19
 - Overview of the ds_set implementation
 - begin, find, destroy_tree, insert
@@ -14,9 +10,6 @@ of pointers to the iterator.
 
 ## Today’s Lecture
 
-- Trivia 1
-- Submini Poll from Lecture 19
-
 - Last piece of ds_set: removing an item, erase
 - Breadth-first and depth-first tree search
 - Tree height, longest-shortest paths, breadth-first search