About This CourseBeginner
Data structures are among the most fundamental ingredients in the recipe for creating efficient algorithms and good software design. Knowledge of how to create and design good data structures is an essential skill required in becoming an exemplary programmer. This course will teach you how to master the fundamental ideas surrounding data structures.
Learn and master the most common data structures in this comprehensive course:
- Static and dynamic arrays
- Singly and doubly linked lists
- Heaps/Priority Queues
- Binary Trees/Binary Search Trees
- Union find/Disjoint Set
- Hash tables
- Fenwick trees
This course provides you with high quality animated videos explaining a multitude of data structures and how they are represented visually. You will learn how to code various data structures together with simple to follow step-by-step instructions. Every data structure presented will be accompanied by some working source code (in Java) to solidify your understanding of that particular data structure. I will also be posting various coding exercises and multiple choice questions to ensure that you get some hands on experience.
- Basic computer science knowledge
What will I learn?
- Mature understanding of data structures
- Algorithms associated with data structures
- Dynamic arrays
- Singly and doubly linked list
- Queues & Stacks
- Binary Trees and Binary search trees
- Heaps & Priority queues
- Union find/Disjoint set
- Hash table/Associative array
- Fenwick tree/Binary indexed tree
Who is the target audience?
- Individuals hungry for new knowledge
- Students who want a fundamental understanding of data structures
Our Promise to You
By the end of this course, you will have learned about advanced data structures.
30 Day Money Back Guarantee. If you are unsatisfied for any reason, simply contact us and we’ll give you a full refund. No questions asked.
Get started today and learn more about advanced data structures.
Abstract Data Types Introduction
Understanding Time/Space Complexity
Static And Dynamic Arrays
Dynamic Array Source Code
Linked List Introduction
Doubly Linked List Source Code
Stack Implementation Details
Stack Source Code
Breadth First Search And Queue Implementation
Queue Source Code
What Is A Priority Queue?
Min Heaps And Max Heaps
Priority Queue Inserting Elements
Priority Queue Removing Elements
Priority Queue Source Code
Union Find Introduction
Union And Find Operations
Union Find Source Code
Introduction To Binary Trees
Binary Search Tree Insertions
Binary Search Tree Removals
Binary Tree Traversals
Binary Search Tree Source Code
Hash Table Hash Functions
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 Removing Key-Value Pairs
Hash Table Open Addressing Source Code
Fenwick Tree Range Queries
Fenwick Tree Point Updates
Fenwick Tree Construction
Fenwick Tree Source Code
AVL Tree Insertions
AVL Tree Removals
AVL Tree Source Code
No Reviews found for this course.