- Requirements and Curriculum
- Linked List Overview : Intro To Linked List
- Appending To A Linked List
- Prepending To A Linked List
- Printing Out Our Linked List
- Remove First Node From Our Linked List
- Remove Last Node From Our Linked List
- Remove Node At A Certain Position From Our Linked List
- Insert Node At A Certain Position Within Our Linked List
- Linked List Destructor
- Doubly Linked List Overview : Intro to Doubly Linked List
- Prepending To A Doubly Linked List
- Appending To A Doubly Linked List
- Insert Node At A Certain Position Within Our Doubly Linked List
- Printing Out Our Doubly Linked List In Reverse
- Remove First Node From Our Doubly Linked List
- Remove Node At A Certain Position From Our Doubly Linked List
- Remove Last Node From Our Doubly Linked List
- Insert Node At A Certain Position Within Our Doubly Linked List
- Stack Overview
- Implementing a Stack using an Array
- Implementing a Stack using a Linked List
- Queue Overview
- Implementing a Queue using an Array
- Implementing a Queue using a Linked List
- Binary Search Tree Overview
- Binary Search Tree Insert Overview
- Binary Search Tree Insert Method
- Binary Search Tree Deletion Overview
- Binary Search Tree Deletion Method
- Binary Min/Max Heap Overview
- Binary Min/Max Heap Insert Overview
- Binary Min/Max Heap Insert (Array Recursive Implementation)
- Binary Min/Max Heap Deletion Overview
- Binary Min/Max Heap Deletion (Array Recursive Implementation)