Log In
Join
for free
Back To Module Home
Data Structures in Python
0% completed
Introduction to Linked Lists
Singly Linked Lists (SLL)
Linked Lists vs. Lists
Basic Linked List Operations
Singly Linked List Insertion
Challenge: Insertion at Tail
Solution: Insertion at Tail
Challenge: Search in a Singly Linked List
Solution: Search in a Singly Linked List
Singly Linked List Deletion
Challenge: Deletion by Value
Solution: Deletion by Value
Doubly Linked Lists (DLL)
Singly Linked Lists vs. Doubly Linked Lists
Challenge: Find the Length of a Linked List
Solution: Find the Length of a Linked List
Challenge: Reverse a Linked List
Solution: Reverse a Linked List
Challenge: Remove Duplicates from Linked List
Solution: Remove Duplicates from a Linked List
Challenge: Union & Intersection of Linked Lists
Solution: Union & Intersection of Linked Lists
Linked Lists Quiz: Test your understanding of Linked Lists
Introduction to Stacks and Queues
What is a Stack?
Stack (Implementation)
What is a Queue?
Queue (Implementation)
Challenge: Generate Binary Numbers from 1 to n using a Queue
Solution: Generate Binary Numbers from 1 to n using Queue
Challenge: Implement Two Stacks Using One List
Solution: Implementing Two Stacks Using One List
Challenge: Evaluate Postfix Expression Using a Stack
Solution: Evaluate Postfix Expression Using a Stack
Challenge: Next Greater Element Using a Stack
Solution: Next Greater Element Using a Stack
Challenge: Check Balanced Parentheses Using Stack
Solution: Check Balanced Parentheses using Stack
Challenge: min( ) Function Using a Stack
Solution: min( ) Function Using a Stack
Stack/Queue Quiz: Test your understanding of Stack/Queue
Introduction to Graphs
What is a Graph?
Types of Graphs
Representation of Graphs
Graph Implementation
Complexities of Graph Operations
Graph Traversal Algorithms
Challenge: Implement Breadth First Search
Solution: Implement Breadth First Search
Challenge: Implement Depth First Search
Solution: Implement Depth First Search
Introduction to Trees
Trees and their Basic Properties!
What makes a tree 'balanced'?
What is a Binary Tree?
More on Complete Binary Trees
Skewed Binary Trees
What is a Binary Search Tree (BST)?
Implementing a Binary Search Tree in Python
Binary Search Tree Insertion
Binary Search Tree Insertion (Implementation)
Searching in a Binary Search Tree (Implementation)
Deletion in a Binary Search Tree
Deletion in a Binary Search Tree (Implementation)
Pre-Order Traversal
Post-Order Traversal
In-Order Traversal
Challenge: Find minimum value in Binary Search Tree
Solution: Find minimum value in Binary Search Tree
Challenge: Find kth maximum value in Binary Search Tree
Solution: Find kth maximum value in Binary Search Tree
Challenge: Find Ancestors of a given node in a BST
Solution: Find Ancestors of a given node in a BST
Challenge: Find the Height of a BST
Solution: Find the Height of a BST
Introduction to Heap
What is a Heap?
Max Heap: Introduction
Max Heap (Implementation)
Min Heap: Introduction
Min Heap (Implementation)
Challenge: Convert Max-Heap to Min-Heap
Solution: Convert Max-Heap to Min-Heap
Introduction to Hashing
What is a Hash Table?
The Hash Function
Collisions in Hash Tables
Building a Hash Table from Scratch
Add/Remove & Search in Hash Table (Implementation)
A Quick Overview of Hash Tables
Dictionary vs Set
Challenge: A List as a Subset of Another List
Solution: A List as a Subset of Another List
Hashing Quiz: Test your understanding of Hashing
Summary of Data Structures
Overview of Linear & Non-Linear Data Structures
Conclusion
Final Remarks
Home
/
...
/
Min Heap (Implementation)
Min Heap (Implementation)
We'll implement a min heap in this lesson!
Implementation
#
...