
CSE101. Fall 2020: Intro to data structures and algorithms
Dormant Last read · last published · next check
Read 6 days ago and current, but nothing has been published for 6 years.
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


CSE101, Lec 17: Loop invariants and the BFS invariant

CSE101, Lec 16: Graphs and BFS

CSE101, Lec 15: Solving algorithms questions, Part II

CSE101, Lec 14: Solving basic algorithms questions with runtime analysis

CSE101, Lec 13: Mergesort and the O(nlog n) run time analysis, and quicksort

CSE101, Lec 12: Hash tables

CSE101, Lec 11: AVL trees

CSE101, Lec 9: Binary Search Trees

CSE101, Lec 10: Tree traversals and self-balancing trees

CSE101, Lec 7: Analysis of binary search

CSE101, Lec 6: More discussion of asymptotic analysis, selection sort and insertion sort

CSE101: Lec 5, more on recursion, asymptotic analysis

CSE101: Lec 4, stacks

