Pseudo code
Recursion
Generic code
Sequential and Binary Search
Collision resolution
Hashed list
Sorting
Prefix to postfix
General liner list
Implementation of linked list
Stack
Queues
Stack Applications
Evaluation of postfix expressions
Trees
General tree
Binary tree
Threaded tree
Binary search tree
AVl search tree part 1
AVl search tree part 2
Expression tree
Heap tree part1
Heap tress part2
Introduction to Multi-way Trees and B-Trees
B-Tree insert operation
B-Tree delete operation
Trie structure
Graphs
Eight queens problem
Minimum Spanning tree
Finding the shortest path
Unit I Refresher
Unit II Refresher