00_Course_Review

01_Slide_1__Lecture_Ove

02_Slide_2__1__Algorith

03_Slide_3__Space_Compl

04_Slide_4__2__Linear_S

05_Slide_5__Linear_Stru

06_Slide_6__Queue_Imple

07_Slide_7__Expression_

08_Slide_8__3__Tree_Fun

09_Slide_9__Tree_Traver

10_Slide_10__Tree_Recon

11_Slide_11__Binary_Sea

12_Slide_12__BST_Mainte

13_Slide_13__Heaps__The

14_Slide_14__Heap_Opera

15_Slide_15__4__Graph_T

16_Slide_16__Graph_Repr

17_Quick_Tips__Right_Si

18_Slide_17__Graph_Trav

19_Slide_18__Graph_Trav

20_Slide_19__Shortest_P

21_Slide_20__Spanning_T

22_Complexity_Compariso

23_Slide_21__5__Sorting

24_Slide_22__Hashing__E

25_Slide_23__Hashing__R

Your Personal AI Tutor

Ask me anything! Here are some ideas to get started:

Understand Concepts

Ask me to explain the current slide or a concept in simple terms.

"Explain recursion in simple terms." "What is a `Class`?"

Generate Code

Request code examples in different programming languages.

"Binary search example in Python" "How to implement adjacency list in C"

Use Your Tone and Language

Ask in different languages or tones and I'll adapt.

"What does acyclic mean" "呢張slide入面個符號g代表咩" "这里`Heap`的中文是什么"

The AI assistant can make mistakes, verify important info.