00:18

16 Kruskal's Exercise 2

01:28

20 MST Applications

01:58

17 Kruskals Exercise 2 Solution

04:51

15 Kruskals Exercise 1 Solution

00:41

12 Sorting Approach to Kruskal's

05:25

11 Merging Segments in a Disjointed Set

01:11

7 Is Prim's result really the same at any node

00:39

14 Kruskal's Exercise 1

03:35

4 Prim's Algorithm

01:29

18 Misnomer about Disjointed Sets

04:01

5 Prims Example 1

05:24

10 Step by Step of Kruskal's

05:07

13 Kruskals Example 1

01:00

6 Prim's Exercise

00:55

9 Introduction to Kruskal's

01:20

1 Intro to Spanning Trees

01:24

3 Solving for an MST

01:33

8 Prim's Code Complexity

01:35

2 Intro to Minimum Spanning Trees

00:55

19 Kruskal's vs Prim's

22:24

Maps - Part 1

10:46

Maps - Part 3

14:39

Maps - Part 2

48:07

Hashing

01:02

15 Further Properties of RBTs

09:56

14 Red Black Trees - Exercises 2

05:01

13 Red Black Trees and Child Handoffs

06:18

12 Red Black Tree Exercise 1

14:45

11 RBT First Example

01:18

10 RBT Bottom up Insertion in Action

00:52

09 Options in Drawing RBTs

00:57

08 Case 4 RBT Insertion Algorithm

01:20

07 Case 3 RBT Insertion Algorithm

01:30

06 Case 2 RBT Insertion Algorithm

01:58

05 Case 1 RBT Insertion Algorithm

01:28

04 Uncles and that damn Crazy Uncle in Red Black Trees

01:54

03 Red Black Trees Bottom up Insertion Algorithms

02:32

02 Red Black Tree Ground Rules

02:12

01 Red Black Tree Introduction

03:06

Building a Left ist Heap - Exercise 3

02:01

Building a Left ist Heap - Exercise 1

03:40

Building a Left ist Heap - Exercise 2

06:50

Merging Left ist Heaps - 1st Example

02:06

Building a Heap Exercise 2

02:31

Building a Heap Exercise 1

00:16

Exercise Deleting from a Heap

02:33

Building a Heap Exercise 3

01:28

So Why do we use left ist heaps

02:16

Deleting from a Left ist Heap

02:12

Left ist Heap Merge Code

00:47

Merging Left ist Heap Exercises

05:42

Merging Left ist Heaps

01:08

The Insert Function

03:06

Building a Left ist Heap Exercise 3

03:40

Building a Left ist Heap Exercise 2

02:01

Building a Left ist Heap Exercise 1

01:08

Building Left ist Heaps Exercises

05:51

Simple Leftist Heap Example

08:46

Building a Left ist Heap

01:32

The Left ist Node Code