↓Skip to main content
  1. Sipping Go/

Easy to Advanced Data Structures

·2 mins
Table of Contents

This is one of the great courses in udemy, on the subject, and his graph theory course.

Course Syllabus #

Introduction #

  • Abstract data types Introduction
  • Understanding time/space complexity

Static and dynamic arrays #

  • Static and dynamic arrays
  • Dynamic array source code

Linked lists #

  • Linked list introduction
  • Doubly linked list source code

Stacks #

  • Understanding stacks
  • Stack implementation details
  • Stack source code

Queues #

  • Understanding queues
  • Breadth first search and queue implementation
  • Queue source code

Priority queues #

  • What is a priority queue?
  • Min heaps and Max heaps
  • Priority queue inserting elements
  • Priority queue removing elements
  • Priority queue source code

Union find/Disjoint set #

  • Union find introduction
  • Kruskal’s Algorithm
  • Union and find operations
  • Path compression
  • Union find source code

Binary search trees #

  • Introduction to binary trees
  • Binary search tree insertions
  • Binary search tree removals
  • Binary tree traversals
  • Binary search tree source code

Hash tables #

  • 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/Binary indexed tree #

  • Fenwick tree range queries
  • Fenwick tree point updates
  • Fenwick tree construction
  • Fenwick tree source code

AVL Tree #

  • Tree rotations
  • AVL tree insertions
  • AVL tree removals
  • AVL tree source code

Indexed Priority Queue #

  • Introduction to indexed priority queues
  • Indexed priority queue source code

Sparse Tables #

  • Sparse Table
  • Sparse Table Source Code
↑