Standard syllabus
Data structures · Undergraduate · CS / Programming
Topics
Analysis and linear structures
- Asymptotic notation: O, Ω, Θ; best/average/worst case
- Dynamic arrays and amortized analysis (intro)
- Linked lists: singly, doubly, and circular variants
- Stacks and queues; applications (parsing, BFS)
- Recursion and recursive data definitions
Trees, hashing, and heaps
- Binary trees; traversals (in-order, pre-order, post-order)
- Binary search trees; search, insert, delete
- Balanced trees overview (AVL, red-black at survey level)
- Hash tables: chaining, open addressing, load factor
- Heaps and priority queues; heap sort (intro)
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
Billed in 15-minute increments (15-minute minimum, up to 4 hours). No subscription required.
$60.00 · 60 min · Undergraduate · Online ($60/hr)
Book through intake or schedule a session.