Easy to Advanced Data Structures

Easy to Advanced Data Structures

A complete guide to learning everything there is to know about data structures

What you’ll learn

  • Algorithms associated with data structures
  • 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


  • Basic computer science knowledge


Data structures are amongst 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
  • Stacks
  • Queues
  • Heaps/Priority Queues
  • Binary Trees/Binary Search Trees
  • Union find/Disjoint Set
  • Hash tables
  • Fenwick trees
  • AVL trees
  • Binary Indexed trees
  • Sparse tables

Course contents

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.

Who this course is for:

This course is quite great, having a complete proper description of all the data structures present with proper explanation and examples for each. I Thank William Fiset For This Course It Helped Me A Lot

Course content

13 sections • 48 lectures • 8h 17m total length
  • Introduction
  • Static and dynamic arrays
  • Linked lists
  • Stacks
  • Queues
  • Priority queues
  • Union find/Disjoint set
  • Binary search trees
  • Hash tables
  • Fenwick tree/Binary indexed tree
  • AVL Tree
  • Indexed Priority Queue
  • Sparse Tables

Created by: William Fiset, (Google engineer; ACM-ICPC world finalist)

Last updated 3/2020
English [Auto]
1.2 GB (Direct Download Available)

(7,116 ratings)
87,684 students

Download link

Friendly Websites

Related Posts

Add a Comment

Your email address will not be published. Required fields are marked *