43:34
13. Flow Networks | Ford Fulkerson Algorithm | Max Flow Theorem | Residual Graph
46:21
12. Augmenting Data Structures | Augmenting Red Black Trees | Augmented Stack
28:14
11.2 Skip List | Time and Space Complexity Computation | Part 2 | Probability Analysis
47:22
11.1 Skip List | Complete Introduction | All Operations with Examples | Advanced Data Structures
44:03
10. Treaps | Complete Introduction | Search, Insert & Delete Operations with Examples
12:59
8.3 Suffix Trees | Advantage with Proof | Examples | Tries | Range Queries
19:37
8.2 Compressed Tries | Advantage with Proof | Examples | Tries | Range Queries
32:47
8.1 Trie Data Structure | Complete Introduction | Tries | All Operations with Examples
19:56
7.4 Fibonacci Heap | Decrease Key operation | Delete operation | with Time Complexity
22:12
7.3 Fibonacci Heap | Extract Minimum operation | Delete Minimum | with Time Complexity
41:49
9.2 Bloom Filters | False Positives with Proof | Applications in Google, Facebook and Quora
27:45
9.1 Bloom Filters | Complete Introduction | All Operations with Examples
16:59
7.2 Fibonacci Heap | Different Operations | Insertion | Union Operation | Advanced Data Structures
14:20
7.1 Fibonacci Heap | Properties | Introduction | Advanced Data Structures
17:16
6.4 All Operations in Binomial Heaps | Advanced Data Structures
23:19
6.3 Merge Operation in Binomial Heaps | Advanced Data Structures
17:38
1.4 Potential Method in Amortized Analysis | With Examples| Advanced Data Structures | Algorithms
13:09
1.1 Amortized Analysis | Introduction with Examples | Advanced Data Structures | Algorithms
08:40
1.3 Accounting Method in Amortized Analysis | Examples of Augmented Stack and Dynamic Tables | DAA
12:02
6.2 Binomial Heap | Properties | Introduction | Structure Of Node | Advanced Data Structures
22:41
6.1 Binomial Trees | Properties with Proof | Introduction | Advanced Data Structures
15:32
5.3 Leftist Heaps Insert & Delete Operation | Leftist Trees | Advanced Data Structures
34:01
5.2 Leftist Heaps Merge Operation | Leftist Heaps| Code, Steps & Example
26:44
5.1 Leftist Trees | Leftist Heaps| Advanced Data Structures| Complete Introduction & Properties
15:20
4.4 Splay Trees Deletion | Top Down Splaying | Advanced Data Structures
15:14
4.3 Splay Trees Deletion | Bottom Up Splaying | Advanced Data Structures
19:42
4.2 Splay Trees Insertion | with Example | Advanced Data Structures
37:20
4.1 What are Splay Trees? | Introduction | Zig | Zig-Zig | Zig-Zag| Advanced Data Structures
19:43
3.5 Deletion in Red Black Tree | Solved Example | Advanced Data Structures
38:19
3.4 Red Black Trees Deletion | all cases and examples | Advanced Data Structures
22:29
3.3 Red Black Trees Insertion | With Examples | Advanced Data Structures
16:51
3.2 Types Of Imbalances | Red Black Trees | Types Of Rotations | with Examples
34:05
3.1 What are Red Black Trees? | Advanced Data Structures| Complete Introduction & Properties
28:08
2.3 Optimal BST | Solved example using DP | Advanced Data Structures
19:45
2.2 Why DP is used for Optimal Binary Search Trees? | with example and intuition
21:24
2.1 What is Optimal Binary Search Tree? Complete Explanation & Examples | Advanced Data Structures
11:26
1.2 Aggregate Method | Amortized Analysis | Advanced Data Structures | Algorithm | DAA
14:11
Advanced Data Structures | Introduction and Syllabus | Design & Analysis of Algorithms
X
About
This channel is for students who want to crack University Exams, Software Engineering Interviews, or just gain knowledge about the magic that some of the less known Advanced Data Structures offer.
Tags