Update README.md
This commit is contained in:
@@ -1,9 +1,5 @@
|
|||||||
# Lecture 20 --- Trees, Part III
|
# 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
|
Review from Lecture 18 & 19
|
||||||
- Overview of the ds_set implementation
|
- Overview of the ds_set implementation
|
||||||
- begin, find, destroy_tree, insert
|
- begin, find, destroy_tree, insert
|
||||||
@@ -14,9 +10,6 @@ of pointers to the iterator.
|
|||||||
|
|
||||||
## Today’s Lecture
|
## Today’s Lecture
|
||||||
|
|
||||||
- Trivia 1
|
|
||||||
- Submini Poll from Lecture 19
|
|
||||||
|
|
||||||
- Last piece of ds_set: removing an item, erase
|
- Last piece of ds_set: removing an item, erase
|
||||||
- Breadth-first and depth-first tree search
|
- Breadth-first and depth-first tree search
|
||||||
- Tree height, longest-shortest paths, breadth-first search
|
- Tree height, longest-shortest paths, breadth-first search
|
||||||
|
|||||||
Reference in New Issue
Block a user