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

freeCodeCamp

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

via freeCodeCamp

Overview

This course aims to teach learners the most common data structures using high-quality animations and step-by-step instructions. By the end of the course, students will be able to code various data structures in Java, including arrays, linked lists, stacks, queues, priority queues, union find, binary search trees, hash tables, Fenwick trees, suffix arrays, balanced binary search trees, AVL trees, and indexed priority queues. The teaching method involves visual representations, working source code examples, and detailed explanations. This course is intended for beginners looking to build a strong foundation in data structures and improve their coding skills.

Syllabus

Abstract data types.
Introduction to Big-O.
Dynamic and Static Arrays.
Dynamic Array Code.
Linked Lists Introduction.
Doubly Linked List 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 open addressing.
Hash table linear probing.
Hash table quadratic probing.
Hash table double hashing.
Hash table open addressing removing.
Hash table open addressing code.
Fenwick Tree range queries.
Fenwick Tree point updates.
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.

Taught by

freeCodeCamp.org

Reviews

5.0 rating, based on 1 Class Central review

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.

Someone learning on their laptop while sitting on the floor.