cse101

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▶CSE101, Fall 22, Lec 12, part 1: Range search in balanced BSTsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
2. 2▶CSE101, Fall 22, Lec 11: AVL treesCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
3. 3▶CSE101, Fall 22, Lec 10, Part 1: Tree traversalsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
4. 4▶CSE101, Fall 22, Lec 10, Part 2: Self balancing trees and rotationsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
5. 5▶CSE101, Fall 22: Lec 6, asymptotic running time analysis of quadratic time sorting algorithmsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
6. 6▶CSE101, Fall 22, Lec 9: Binary Search TreesCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
7. 7▶CSE101, Fall 22, Lec 8: Binary heapsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
8. 8▶CSE101, Fall 22, Lec 7, Part 1: Analysis of binary searchCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
9. 9▶CSE101, Fall 22, Lec 7, Part 2: An introduction to priority queues and binary heapsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
   +Watch later
10. 10▶CSE101, Fall 22, Lec 5: Starting asymptotic analysis of algorithms, big-Oh notationCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
11. 11▶CSE101, Fall 22, Lec 4: Stacks and recursionCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
12. 12▶CSE101 Fall 22, Lec 3, Part 3: An introduction to simulating recursion through stacksCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
13. 13▶CSE101 Fall 22, Lec 3, Part 2: An introduction to stacks and parentheses checkingCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
14. 14▶CSE101 Fall 22, Lec 3, Part 1: Reversing a linked listCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
15. 15▶CSE101, Fall 22: Linked listsCSE101, Fall 2022, Introduction to Data Structures and AlgorithmsNotes
    +Watch later
16. 16▶CSE101, Lec 18: Single-Source Shortest PathsCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
17. 17▶CSE101, Lec 17: Loop invariants and the BFS invariantCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
18. 18▶CSE101, Lec 16: Graphs and BFSCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
19. 19▶CSE101, Lec 15: Solving algorithms questions, Part IICSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
20. 20▶CSE101, Lec 14: Solving basic algorithms questions with runtime analysisCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
21. 21▶CSE101, Lec 13: Mergesort and the O(nlog n) run time analysis, and quicksortCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
22. 22▶CSE101, Lec 12: Hash tablesCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
23. 23▶CSE101, Lec 11: AVL treesCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
24. 24▶CSE101, Lec 9: Binary Search TreesCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
25. 25▶CSE101, Lec 10: Tree traversals and self-balancing treesCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
26. 26▶CSE101, Lec 7: Analysis of binary searchCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
27. 27▶CSE101, Lec 6: More discussion of asymptotic analysis, selection sort and insertion sortCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
28. 28▶CSE101: Lec 5, more on recursion, asymptotic analysisCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
29. 29▶CSE101: Lec 4, stacksCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later
30. 30▶CSE101, Lec 2: Linked listsCSE101. Fall 2020: Intro to data structures and algorithmsNotes
    +Watch later