JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
NehaKeshan
2024-03-26 12:03:52 -04:00
committed by GitHub
parent 92d156e45e
commit aa2a103202
1 changed files with 0 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
lectures/20_trees_III/README.md
View File

@@ -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