04:33

Kruskal's Algorithm

07:18

Prim's Algorithm

13:04

Dijkstra Algorithm - Example

13:44

Dijkstra Algorithm

19:08

Breadth First Search - Pseudo Code

15:34

Breadth First Search

19:11

Depth First Search - Pseudo Code

10:17

Depth First Search - Part 2

14:55

Depth First Search - Part 1

14:29

Graphs

17:36

Huffman Encoding

09:55

Encoding Tries

07:17

Suffix Tries

11:04

Compressed Tries

09:40

Tries

15:58

In Place Heap Sort

06:47

Heap Sort

09:41

Heaps - Bottom Up Construction

13:45

Heaps

05:35

AVL Tree - Deletion

19:35

AVL Tree - Insertion

09:34

AVL Tree - Double Rotation

14:08

AVL Tree - Single Rotation

15:43

Binary Search Tree - Search Complexity

16:48

Binary Search Tree - Deletion Pseudo Code

07:35

Binary Search Tree - Deletion

08:27

Binary Search Tree - Insertion Pseudo Code

08:24

Binary Search Tree - Search Pseudo Code

05:35

Binary Search Tree

15:41

Tree Traversal

04:24

Implementation of Binary trees

08:02

Binary Tree

04:45

Trees - Depth

12:20

Trees - Height

08:31

Implementation of Trees

08:28

Introduction to Trees

08:18

Hashing - Bloom Filter

07:23

Hashing - Rehashing

04:49

Hashing - Double Hashing

11:03

Hashing - Quadratic Probing

15:34

Hashing - Linear Probing

06:36

Hashing - Separate Chaining

06:52

Hashing - Compression Map

18:10

Hashing - Hash Codes

10:25

Introduction to Hashing

09:53

Linked List - Printing

10:26

Linked List - Deletion by search

07:19

Linked List - Deletion at the end

07:38

Linked List - Deletion at the beginning

12:53

Linked List - Addition before a node

13:52

Linked List - Addition after a node

09:36

Linked List - Addition at the end

09:12

Linked List - Addition at the beginning

11:33

Implementation of Linked Lists

14:03

Introduction to Linked Lists

09:29

Radix Sort

15:51

Bucket Sort

15:51

Merge Sort - Pseudo Code

12:48

Merge Sort

12:19

Merge - Pseudo Code