18:15
Understanding and implementing a Linked List in C and Java
Jacob Sorber
6:07
Doubly Linked List (in C)
24:54
Understanding and implementing a Hash Table (in C)
13:26
Bit Fields in C. What are they, and how do I use them?
17:04
Should you avoid linked lists? (linked list vs arrays)
15:38
How to Implement a Stack in C (+ encapsulation)
7:53
How to Implement a Queue in C
20:24
Fixed and Variable Length Arrays in C and C++
14:39
How to Implement a Tree in C
13:20
Understand and Implement a Binary Search Tree in C
11:23
Implementing a Circular Queue in C
13:41
Make your Data Type more Abstract with Opaque Types in C
17:00
Project Setup: Automated Testing with Make (using queue example)
10:37
How Look Up Tables (LUTs) make your code Smaller, Faster, and Better (example in C)
21:07
The Trie Data Structure (Prefix Tree)
16:46
The Trie Data Structure, Part 2 (search, delete)
23:40
Working with a Matrix/2D Array in Your C and C++ programs.
8:55
What is a Graph Data Structure? When to use it? How to easily visualize it?
20:04
How To Implement a Graph in C. (adjacency matrix version)
13:44
What's the Best Way to Copy a Struct in C and C++?
41:20
A better hash table (in C)
10:04
Fixing our "better" hash table's memory leaks (in c)
11:14
Does it matter what hash function I use? (hash table example in c)
17:48
Binary data exercise: how to tell if a file is a jpeg?
5:44
How to sort part of an array in C
23:14
What is an object pool, and how to create one in C?
17:34
Making allocators and object pools faster using a free list
14:03
A better way to create a 2D array in C?