Module 4
0:00 Representation of Trees
1:25 Additional Tree Operations
3:03 Preorder, Inorder & Postorder
5:10 Threaded Binary Tree
6:20 Code for Threaded BT
7:09 Binary Search Tree
9:13 Expression Tree
10:36 Code for Pre, In & Postorder
Module 5
11:29 Graph Representation
13:11 BFS
15:31 DFS
18:10 Insertion Sort
25:21 Radix Sort Code
32:01 Radix Sort Logic
32:55 Hashing
34:21 Address Calculation Sort
35:38 Files & their Organisation
