wi24

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶[CSE 373WI24] Lecture 16: Minimum Spanning TreesCSE 373 Winter 24 LecturesNotes
   +Watch later
2. 2▶[CSE 373 WI24] Lecture 15: Shortest PathCSE 373 Winter 24 LecturesNotes
   +Watch later
3. 3▶[CSE 373 WI24] Lecture 14: Graph TraversalsCSE 373 Winter 24 LecturesNotes
   +Watch later
4. 4▶[CSE 373 WI24] Lecture 13: Intro to GraphsCSE 373 Winter 24 LecturesNotes
   +Watch later
5. 5▶[CSE 373 WI24] Lecture 12: Heap ImplementationCSE 373 Winter 24 LecturesNotes
   +Watch later
6. 6▶[CSE 373 WI24] Lecture 11: Intro to HeapsCSE 373 Winter 24 LecturesNotes
   +Watch later
7. 7▶[CSE 373 WI24] Lecture 10: Self Balancing TreesCSE 373 Winter 24 LecturesNotes
   +Watch later
8. 8▶[CSE 373 WI24] Lecture 08: Hash Collision ResolutionsCSE 373 Winter 24 LecturesNotes
   +Watch later
9. 9▶[CSE 373 WI24] Lecture 09: AVL TreesCSE 373 Winter 24 LecturesNotes
   +Watch later
10. 10▶[CSE 373 WI24] Lecture 07: Intro to HashingCSE 373 Winter 24 LecturesNotes
    +Watch later
11. 11▶[CSE 373 WI24] Lecture 06: Analyzing Recursive CodeCSE 373 Winter 24 LecturesNotes
    +Watch later
12. 12▶[CSE 373 WI24] Lecture 05: Big O & Case AnalysisCSE 373 Winter 24 LecturesNotes
    +Watch later
13. 13▶[CSE 373 WI24] Lecture 04: Intro to Runtime AnalysisCSE 373 Winter 24 LecturesNotes
    +Watch later
14. 14▶[CSE 373 WI24] Lecture 03: ADTs to knowCSE 373 Winter 24 LecturesNotes
    +Watch later
15. 15▶[CSE 373 WI24] Lecture 02: Intro to ADTsCSE 373 Winter 24 LecturesNotes
    +Watch later