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 Lecture Quizzes
1. 9/23 Welcome! 2. 9/25 From Python to C++ 3. 9/27 Strings 4. 9/30 Vectors and Grids 5. 10/2 Stacks and Queues 6. 10/4 Sets and Maps 7. 10/7 Introduction to Recursion 8. 10/9 Big O and Asymptotic Analysis 9. 10/11 Procedural Recursion 10. 10/14 Fractals 11. 10/16 Backtracking 1 12. 10/18 Backtracking 2 13. 10/21 C++ Classes 14. 10/23 Dynamic Memory 15. 10/25 Memory and Pointers 16. 10/28 Midterm Review 17. 10/30 Ethics of Prioritization 18. 11/1 Heaps 19. 11/4 Sorting 20. 11/6 Linked Lists 1 21. 11/8 Linked Lists 2 22. 11/11 Trees 23. 11/13 Binary Search Trees 24. 11/15 Huffman Coding 25. 11/18 Hashing 26. 11/20 Graphs 27. 11/22 Graph Shortest Path Algorithms 28. 12/2 The A-Star Algorithm and some Esoteric Data Structures 29. 12/4 More on Esoteric Data Structures 30. 12/6 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. Tone Matrix 6. Linked Lists 7. Huffman Coding
Sections
About Sections Section Portal
1. C++ fundamentals 2. ADTs, Big-O, and Intro to Recursion 3. Recursion and Intro to Backtracking 4. Recursive Backtracking 5. Classes and Dynamic Memory 6. Memory Management, Pointers, and Linked Lists 7. Linked Lists and Trees 8. Trees
Assessments
About Assessments
1. Midterm Exam 2. Final Exam
🗓Schedule
🔍Search

Lecture 24. Huffman Coding

Friday November 15

In this lecture we will discuss encoding and specifically Huffman Coding.

Readings

Huffman handout

Links

Slides
Video on canvas

📦 Code

All course materials © Stanford University 2021
Website programming by Julie Zelenski • Styles adapted from Chris Piech • This page last updated 2024-Nov-15