This is the lecture note of CS61B - Lecture 19.

This is the lecture note of CS61B - Lecture 17.

In today's lecture, we are gonna be primarily concerned with one thing: tree height.

This is the lecture note of CS61B - Lecture 16.

This is the lecture note of CS61B - Lecture 15.

In this lecture, we will try to do some exercises to make us understand asymptotic analysis more deeply.

This is the lecture note of CS61B - Lecture 14.

In this lecture, we are going to focus on a data structure called Disjoint Sets or Union Find(并查集). We will see how to design it by solving the "Dynamic Connectivity" problem, and see how our underlying data structures can affect asymptotic runtime (using our formal Big-Theta notation) and code complexity.

This is the lecture note of CS61B - Lecture 13.

⛱️ This is the lecture note of CS61B - Lecture 12.

In this lecture, we will do some warm-up theoretically for the Project 2: Gitlet.

This is the lecture note of CS61B - Lecture 11.

This is the lecture note of CS61B - Lecture 10.

⛱️ In this lecture, we will talk about Polymorphism of Java, and continue discussing HoFs deeply.

This is the lecture note of CS61B - Lecture 9.

🌳 In this lecture, we will talk more about implementation inheritance.