Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Mastering Data Structures and Algorithms
Course Introduction
Course Introduction (3:30)
Curriculum Walkthrough (15:34)
Big O Notation
Section Introduction (1:43)
Complexity Analysis (5:25)
Why we need Big O Notation? (6:31)
Big O(n) Complexity (7:47)
Big O(1) Complexity (4:04)
Counting Operations (3:32)
Simplifying Big O - Part 1 (7:19)
Big O(n^2) Complexity (3:44)
Simplifying Big O - Part 2 (2:35)
Big O(n!) Complexity (1:25)
Space Complexity (4:39)
Space Complexity - II (1:44)
Section Summary (1:38)
Essential Concepts - I
Memory (11:25)
Logarithm (11:12)
Data Structure - Introduction
Introduction to Data Structures (7:07)
Data Structures - Array
Array Introduction (4:40)
Array - Common Operations I (8:02)
Array - Common Operations II (8:04)
Static vs Dynamic Array - Common Operations III (7:25)
Data Structures - Linked List
Linked List (25:54)
Linked List Complexities (20:43)
Doubly Linked List (7:27)
Circular Linked List and Implementing A Linked List (15:29)
Data Structures - Stack and Queue
Stack and Queue (26:18)
Data Structures - Hash Tables
Hash Tables (34:42)
Data Structures - Trees
Tree - Part 1 (17:32)
Tree - Part 2 (5:22)
Binary Tree (13:49)
Types of Binary Tree
Binary Search Tree (28:57)
AVL - Red Back Tree (7:58)
Data Structures - Heaps
Heaps (29:05)
Heap Sort and Priority Queue (13:50)
Data Structures - Trie
Trie - I (12:59)
Trie - II (20:33)
Why Tries are Important? (3:04)
Data Structures - Graph
Graph (32:08)
Quiz
Quiz 1: Data Structures and Algorithms
Quiz 2: Data Structures and Algorithms
Essential Concepts - II
What is Recursion? (7:13)
Recursion: Control of a Function (7:00)
Recursion: Tracing Tree (17:55)
Recursion: Understanding Call Stack (16:10)
Recursion: Tree Recursion (18:48)
Recursion Example - Factorial of a Number (7:38)
Quiz
Quiz 3: Data Structures and Algorithms
Algorithm: Searching
Linear Search (7:30)
Binary Search (10:57)
Binary Search Complexity (4:34)
Binary Search Implementation (5:14)
Binary Search Implementation - Recursion (25:48)
Algorithm: Sorting Elementary
Sorting Algorithm Introduction (2:20)
Bubble Sort (4:52)
Bubble Sort Visualization (2:25)
Bubble Sort Implementation (7:19)
Bubble Sort Complexity (3:32)
Selection Sort (4:11)
Selection Sort Visualization (3:21)
Selection Sort - Implementation (6:59)
Selection Sort - Complexity (2:32)
Insertion Sort (3:48)
Insertion Sort Implementation (7:43)
Insertion Sort Complexity (2:35)
Performance Analysis (4:07)
Algorithm: Sorting Advanced
Quick Sort (22:21)
Quick Sort Complexity (12:52)
Quick Sort Implementation (10:58)
Merge Sort (13:11)
Merge Sort Complexity (5:37)
Merge Sort Implementation (21:51)
Algorithms: Tree Traversal
Tree Traversal (18:52)
Depth First Search - Preorder Inorder Postorder (10:02)
Binary Tree Implementation (9:54)
Depth First Search - Implementation (20:42)
Depth First Search - Complexity (3:18)
Breadth First Search - Level Order (10:10)
Breadth First Search - Implementation (13:26)
Breadth First Search - Complexity (2:19)
Algorithms: Graph Traversal
Graph Traversal (5:55)
Graph Implementation (8:08)
Breadth First Search - Implementation (14:27)
Depth First Search - Implementation (8:38)
Graph Traversal Complexity (3:29)
Implementations and Interview Questions
Data Structure Implementation (5:56)
Problem Solving Approach (9:36)
IQ 1 - Two Sum
Two Sum (12:52)
IQ 2 - Min Stack
Min Stack (15:47)
Min Stack Implementation (7:11)
IQ 3 - Max Stack
Max Stack (4:03)
IQ 4 - Design a Linked List
Design a Linked List - I (12:16)
Design a Linked List - II (18:48)
Design a Linked List - III (12:14)
Design a Linked List - IV (15:52)
IQ 5 - Reverse Linked List
Reverse Linked List - I (23:02)
Reverse Linked List - II (5:37)
IQ 6 - Construct Binary Tree
Traversal (Preorder-Inorder-Postorder) (16:38)
Construct BT: From Preorder and Inorder Traversal - I (29:43)
Construct BT: From Preorder and Inorder Traversal - II (26:56)
IQ 7 - Invert Binary Tree
Invert Binary Tree - I (20:10)
Invert Binary Tree - II (12:51)
IQ 8 - Construct Binary Search Tree
Construct BST: From Preorder Traversal (27:43)
Construct BST: From Preorder Traversal - II (1:03)
IQ 9 - Detect Capital
Detect Capital (15:03)
IQ 10 - Reverse String
Reverse String (13:13)
IQ 11 - Longest Palindromic Substring
Longest Palindromic Substring - I (21:58)
Longest Palindromic Substring - II (17:18)
Thank You For Being Here!
Thank You For Being Here! (0:42)
Course Completion Certificate
Course Completion Certificate
Teach online with
Tree Traversal
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock