🏠CS106B
Course
Syllabus
Common questions
Course placement
Getting help
Honor Code
Setting up Qt Creator
Meet the teaching team
Lectures
About Lectures
1. 9/14 Welcome!
2. 9/16 C++ Fundamentals
3. 9/18 Strings
4. 9/21 Vectors and Grids
5. 9/23 Stacks and Queues
6. 9/25 Sets and Maps
7. 9/28 Big O and Asymptotic Analysis
8. 9/30 Introduction to Recursion
9. 10/2 Fractals
10. 10/5 Procedural Recursion
11. 10/7 Backtracking 1
12. 10/9 Backtracking 2
13. 10/12 C++ Classes
14. 10/14 Dynamic Memory
15. 10/16 Memory and Pointers
16. 10/19 Implementing StackInt
17. 10/21 Heaps
18. 10/23 Sorting
19. 10/26 Linked Lists 1
20. 10/28 Linked Lists 2
21. 10/30 Trees
22. 11/2 Binary Search Trees
23. 11/4 Huffman Coding
24. 11/6 Hashing
25. 11/9 Graphs
26. 11/11 Graph Shortest Path Algorithms
27. 11/13 Esoteric Data Structures
28. 11/16 Lexicon Case Study
29. 11/18 Course wrap-up
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursion
4. Backtracking
5. Priority Queue
6. Linked Lists
7. Huffman Coding
Sections
About Sections
Section Portal
1. C++ fundamentals
2. Big-O and Recursion
3. Recursive Backtracking
4. Classes
5. Pointers
6. Linked lists
7. Trees
8. Review
Assessments
About Assessments
1. Mid-Quarter Diagnostic
2. Personal Project
🗓Schedule
🔍Search
⚠️ This page is out of date, from a past version of the course Fall Quarter 2020. The current quarter site is at
cs106b.stanford.edu
Lecture 17. Heaps
Wednesday October 21
We are learning about the "heap" data structure
Readings
Text
14.3,16.5
Links
Slides
Lecture Q&A
Video on canvas
📦 Code