🏠CS106B
Course
Syllabus
Common questions
Course placement
Getting help
Honor Code
Meet the teaching team
Resources
LaIR
Ed Discussion Forum
Paperless
Qt Installation Guide
C++ Reference
Stanford Library Documentation
Style Guide
Testing Guide
Classes Syntax Reference Sheet
Python to C++ Guide
Submission Checklist
Textbook
Lectures
About Lectures
1. 3/28 Welcome!
2. 3/30 From Python to C++
3. 4/1 Strings
4. 4/4 Vectors and Grids
5. 4/6 Stacks and Queues
6. 4/8 Sets and Maps
7. 4/11 Big O and Asymptotic Analysis
8. 4/13 Introduction to Recursion
9. 4/15 Fractals
10. 4/18 Procedural Recursion
11. 4/20 Backtracking 1
12. 4/22 Backtracking 2
13. 4/25 C++ Classes
14. 4/27 Dynamic Memory
15. 4/29 Memory and Pointers
16. 5/2 Guest Lecture on Ethics, Diana Acosta Navas
17. 5/4 Implementing StackInt
18. 5/6 Heaps
19. 5/9 Sorting
20. 5/11 Linked Lists 1
21. 5/13 Linked Lists 2
22. 5/16 Trees
23. 5/18 Binary Search Trees
24. 5/20 Huffman Coding
25. 5/23 Hashing
26. 5/25 Graphs
27. 5/27 Graph Shortest Path Algorithms
28. 6/1 Course wrap-up
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursion Etudes
4. Backtracking
5. Priority Queue
6. Linked Lists
7. Huffman Coding
Sections
About Sections
Section Portal
1. C++ fundamentals
2. ADTs, Big-O, and Intro to Recursion
3. Recursion
4. Recursive Backtracking
5. Classes and Dynamic Memory
6. Memory Management, Pointers, and Linked Lists
7. Linked Lists
8. Trees
Assessments
About Assessments
1. Midterm Exam
2. Final Exam
🗓Schedule
🔍Search
⚠️ This page is out of date, from a past version of the course Spring Quarter 2022.
Lecture 18. Heaps
Thursday May 6
We are learning about the "heap" data structure
Readings
Text
14.3,16.5
Links
Slides
[Lecture Q&A]
[Video on canvas]
📦 Code