Data Structures with Generic Types in Python

Gain insights into array-based and linked list-based data structures, explore advanced structures like skiplists and hashing, and discover template-based collections for efficient data storage and retrieval.

Beginner

96 Lessons

29h

AI-POWERED

Explanations

AI-POWERED

Explanations

This course includes

46 Playgrounds

14 Quizzes

This course includes

46 Playgrounds

14 Quizzes

Course Overview

Data structures and algorithms are essential in computer science since they play a crucial role in efficient information retrieval and processing, dealing with files, storing contacts on phones, social networks and web searches. In this course, you’ll learn about the array-based implementation of various linear data structures, stack, and queues. You’ll also learn about linked list-based implementation. Next, you’ll explore advanced data structures like skiplists and hashing. You’ll learn how to implement ...Show More

What You'll Learn

A thorough understanding of data structures and algorithms

Working knowledge of array-based, linked list-based, and blended implementations

Hands-on experience of Python interfaces, classes, and templates

Familiarity with complexity analysis of data structures and related algorithms

What You'll Learn

A thorough understanding of data structures and algorithms

Course Content

Overview

Get familiar with data structures, their efficiency, interfaces, and mathematical basics in Python.

Introduction The Need for Efficiency Interfaces Mathematical Background The Model of Computation Approach and Coverage Quiz Discussion

Array-Based Lists

Unpack the core of array-based lists, including stacks, queues, deques, and efficiency optimizations.

Array Implementation of Stack ArrayQueue: An Array-Based Queue ArrayDeque: Fast Deque Operations Using an Array DualArrayDeque: Building a Deque from Two Stacks RootishArrayStack: A Space-Efficient Array Stack Analysis of RootishArrayStack Quiz on Array-Based Lists Discussion on Array-Based Lists Exercise: Array-Based Lists Solution: Array-Based Lists

Linked Lists

Work your way through SLList, DLList, and SEList efficiency, operations, and analysis.

SLList: A Singly-Linked List DLList: A Doubly-Linked List SEList: A Space-Efficient Linked List Operations on SEList Amortized Analysis of Spreading and Gathering Quiz on Linked Lists Discussion on Linked Lists

Skiplists

Enhance your skills in efficient data structure management with skiplists' O(log n) operations.

Introduction to Skiplist SkiplistSSet: An Efficient SSet SkiplistList: An Efficient Random-Access List Analysis of Skiplists Quiz on Skiplists Discussion on Skiplists Exercise: Skiplists Solution: Skiplists

Hash Tables

Dig into hash tables, their types, hashing techniques, practical exercises, and performance discussions.

ChainedHashTable: Hashing with Chaining LinearHashTable: Linear Probing Hash Codes Quiz on Hash Tables Discussion on Hash Tables Exercise: Hash Tables Solution: Hash Tables

Binary Trees

5 Lessons

Simplify complex topics related to binary tree structures, their operations, and practical implementations.

Random Binary Search Trees

6 Lessons

Piece together the parts of Random Binary Search Trees, Treaps, theoretical analysis, and implementation exercises.

Scapegoat Trees

6 Lessons

Step through Scapegoat Trees, analyzing operations, performance, and optimization techniques.

Red-Black Trees

5 Lessons

Get started with red-black trees for efficient and balanced data structure operations.

10.

Heaps

6 Lessons

Break apart heaps, including binary and meldable, with their implementation and efficiency.

11.

Sorting Algorithms

9 Lessons

Grasp the fundamentals of merge-sort, quicksort, heapsort, comparison bounds, and counting-based sorting techniques.

12.

Graphs

8 Lessons

Deepen your knowledge of graph structures, their representations, traversals, and algorithms.

13.

Data Structures for Integers

4 Lessons

Investigate integer data structures like BinaryTrie, XFastTrie, and YFastTrie for efficient operations.

14.

External Memory Searching

6 Lessons

Master efficient external memory searching with B-trees, focusing on balanced depth and minimal disk access.

15.

Wrap Up

1 Lesson

Learn how to use data structures and algorithms in Python effectively.

Trusted by 1.4 million developers working at companies

Anthony Walker

@_webarchitect_

Emma Bostian 🐞

@EmmaBostian

Evan Dunbar

ML Engineer

Carlos Matias La Borde

Software Developer

Souvik Kundu

Front-end Developer

Vinay Krishnaiah

Software Developer

Eric Downs

Musician/Entrepeneur

Kenan Eyvazov

DevOps Engineer

Anthony Walker

@_webarchitect_

Emma Bostian 🐞

@EmmaBostian

Hands-on Learning Powered by AI

See how Educative uses AI to make your learning more immersive than ever before.

Instant Code Feedback

Evaluate and debug your code with the click of a button. Get real-time feedback on test cases, including time and space complexity of your solutions.

AI-Powered Mock Interviews

Put your skills to the test in a simulated interview setting. Receive personalized feedback based on your performance. Available in Premium & Premium Plus plans.

Adaptive Learning

At various checkpoints throughout Educative courses, you will be prompted to take a quick assessment. Receive a condensed curriculum tailored to your strengths and skill gaps.

Explain with AI

Select any text within any Educative course, and get an instant explanation — without ever leaving your browser.

AI Code Mentor

AI Code Mentor helps you quickly identify errors in your code, learn from your mistakes, and nudge you in the right direction — just like a 1:1 tutor!