Tries Part II, Huffman Coding
Channel:
Subscribers:
2,640
Published on ● Video Link: https://www.youtube.com/watch?v=tiy51Q4zohQ
2Since Tries hold strings without actually holding strings, it is interesting to think about how to recover what strings you have in a Trie. You do so by building a string as you traverse down through the Trie.
We then talked about Huffman Coding, which uses a Trie and a Heap together to do text compression.
Other Videos By Bill Kerney
| 2022-05-09 | Sample Project - Grocery Store |
| 2022-05-09 | Evaluating Media Sources |
| 2022-05-06 | Threads and Sockets Programming in Java |
| 2022-05-06 | Java for the C++ Programmer in 1 Hour |
| 2022-05-06 | Automation and the Chip Shortage |
| 2022-05-04 | C++ Trivia Quiz |
| 2022-05-04 | Threads II: Atomics, Mutexes, Thread-Specific Variables |
| 2022-05-04 | Binary Representations + Digital Ownership |
| 2022-05-02 | C++ Threads in 11 minutes |
| 2022-05-02 | Consciousness |
| 2022-04-29 | Tries Part II, Huffman Coding |
| 2022-04-29 | Python in 50 minutes |
| 2022-04-27 | Tries |
| 2022-04-27 | Set Theory: Different Sized Infinities; Brief intro to Python |
| 2022-04-26 | Quadtrees (Pt II), K-D Trees, BSP Trees, AABBs vs OBBs |
| 2022-04-25 | Composite Data Structures |
| 2022-04-25 | Symbolism and Semantics |
| 2022-04-23 | Shapes (Linear Algebra review), Bitwise Operations Part II, Vim Macros |
| 2022-04-22 | Sea Shanty Workshop |
| 2022-04-21 | Operator() and [], Writing Tests, Bitwise Operations |
| 2022-04-20 | Set Theory Part I |
Tags:
csci 41
c++
trie
tries
huffman coding
heap
recursion