43:59

Stack part 3

01:06:08

Stack part 2

36:23

PrefixPostFix

56:52

Stack part 1

47:17

Circular linked list

40:37

Double linked list

01:04:12

Single linked list part 2

39:02

Single linked list part 1

34:34

Array data structure part 3

01:01:14

Array data structure part 2

55:27

Array data structure part 1

20:49

Data Structures and Algorithms part 3

38:54

Data Structures and Algorithms part 2

52:22

Data Structures and Algorithms part 1

36:50

Huffman Tree

34:52

BST Insertion and Deletion

48:37

BST Concepts and Traversals

34:48

Dequeue

48:44

Queue part 3

34:20

Queue part 2

24:48

Queue part 1

38:23

Heap sort part 3

20:55

Heap sort part 2

26:57

Heap sort part 1

26:17

Quick sort part 2

32:20

Quick sort part 1

37:19

Merge sort part 2

33:03

Merge sort part 1

22:10

Radix sort

24:49

Bucket Sort

21:15

Shell sort part 2

24:29

Shell sort part 1

37:27

Insertion sort

34:55

Bubble sort

24:41

Selection sort

24:55

Sorting Introduction

30:18

Kurskul Algorithm

33:20

Prims Algorithm part 2

21:44

Prims Algorithm part 1

22:05

Dijkstra Algorithm part 2

29:52

Dijkstra Algorithm part 1

15:11

Floyd Modified Warshall Algorithm

11:50

Warshall Algorithm part 2

12:19

Warshall Algorithm part 1

13:36

Path Matrix Algorithm

19:08

Graph traversals part 2

21:33

Graph traversals part 1

10:27

Graph operations

16:51

Graph Concepts part 2

18:36

Graph Concepts part 1

07:34

AVL 4

13:53

AVL 3

10:55

AVL 2

16:21

AVL 1

19:53

Threaded BST