You Playlist of All Data Structures Videos:
You Playlist of All Data Structures Videos:
Week 1 - Introduction to C++
Welcome
Intro to Data Structures
Intro to C
Style and Function Decomp
C++ Strings and Streams
Pass by What
Advanced Loops
Review Pointers
Week 2 - Abstract Data Types
Intro to ADTs
ADTs: Dynamic Arrays
ADTS: 2D Dynamic Arrays
ADTs: Stacks
ADTs: Queues
ADTs: Sets
ADTs: Map
ADTs: Ourvector
Week 3 - Big O and C++ Containers
Intro to BigO
C++ ContainersÂ
Terminology of C++ Containers
Vectors In C++
Stacks Queues In C++
Set In C++
Map In C++
Summarize BigO C++Â Containers
Week 4 - Big O and Search/Sort Algorithms
Intro To Search And Sort
Linear Search
Binary Search
Insertion Sort
  Selection Sort
Merge Sort
Quick sort
Summary Of Search Sort
Week 5 - How to Design and Implement an ADT
Designing Abstractions Review Of Classes
Designing Abstractions Intro
Designing Classes - Header Vs Implementation File
Implementing Abstractions this Keyword Pointers Memory
Implementing Abstractions new delete Dynamic Memory Allocation
Implementing Abstractions Constructor Destructor
Implementing Abstractions Member Functions BigO
Implementing Abstractions Copy Constructor Equals Operator
Week 6 - Testing, Diagramming, and Memory Mapping
Intro To Testing
Unit Testing
G Test: Example1 Random Bag
G Test: Example2 ourvector
Templates
DiagrammingÂ
Memory MappingÂ
Memory Mapping RecursionÂ
Week 7 - Linked Lists
Where We Are Data StructuresÂ
Intro To LinkedListsÂ
LinkedList TraversalÂ
LinkedList BuildÂ
LinkedList Clear
LinkedList Insert AtÂ
LinkedList Remove AtÂ
LinkedList Class Summary And BigOÂ
Week 8 - Binary Search Trees
Intro To Trees
Intro To BSTs
BSTs: Search
BSTs: Insert
BSTs: traversalsÂ
BSTs: heightÂ
BSTs: BigO Analysis
BSTs: More Algorithms
Week 9 - AVL Trees
Intro To AVL Trees
AVLs: Insert
AVL: Right Rotate
AVLs: More On RotationsÂ
AVL: All Rotations default
AVL: Proof of Concept
Red Black Trees
2-3 Trees
Week 10 - Hash Tables
Intro to Hash Tables
Examples of Hashing
Hash Functions
Examples of Hash Functions
Hashing - Intro to Collisions
Hashing - Chaining
Hashing - Probing
General - Hash Function
Week 11 - Revisit Abstract Data Types vs. Data Structures
Abstraction vs Data Structures Revisited
Maps Revisited
Unordered Maps Revisited
Sets Revisited
Priority Queue
Min Heap
Tries
Treaps
Week 12 - Graphs
Intro to Graphs
K - Coloring
Graphs - Terminology
Graph Representation - Adjacency List
Graph Representation - Adjacency Matrix
Graph Class
Breadth First Search
Depth First Search
Week 13 - More Graph Algorithms
Dijkstra's - Part 1
Dijkstra's - Part 2
A*
Minimum Spanning Trees (MSTs)
Kruskal's
Applications of Minimum Spanning Trees
Networks
Other Applications with Graphs
Week 14 - Interview and Oral Exam Prep
Week 15 - Data Structures Storytime