Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

# Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer

via freeCodeCamp

### Overview

Introduction to Big-O.Dynamic and Static Arrays.Dynamic Array Code.Linked Lists Introduction.Doubly Linked List Code.Stack Code.Queue Code.Priority Queue introduction.Union Find Kruskal's Algorithm. Union Find - Union and Find Operations.

### Syllabus

Abstract data types.
Introduction to Big-O.
Dynamic and Static Arrays.
Dynamic Array Code.
Stack Introduction.
Stack Implementation.
Stack Code.
Queue Introduction.
Queue Implementation.
Queue Code.
Priority Queue Introduction.
Priority Queue Min Heaps and Max Heaps.
Priority Queue Inserting Elements.
Priority Queue Removing Elements.
Priority Queue Code.
Union Find Introduction.
Union Find Kruskal's Algorithm.
Union Find - Union and Find Operations.
Union Find Path Compression.
Union Find Code.
Binary Search Tree Introduction.
Binary Search Tree Insertion.
Binary Search Tree Removal.
Binary Search Tree Traversals.
Binary Search Tree Code.
Hash table hash function.
Hash table separate chaining.
Hash table separate chaining source code.
Hash table linear probing.
Hash table double hashing.
Fenwick Tree range queries.
Fenwick Tree construction.
Fenwick tree source code.
Suffix Array introduction.
Longest Common Prefix (LCP) array.
Suffix array finding unique substrings.
Longest common substring problem suffix array.
Longest common substring problem suffix array part 2.
Longest Repeated Substring suffix array.
Balanced binary search tree rotations.
AVL tree insertion.
AVL tree removals.
AVL tree source code.
Indexed Priority Queue | Data Structure.
Indexed Priority Queue | Data Structure | Source Code.

freeCodeCamp.org

## Reviews

Start your review of Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer

### Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.