Lalitha Natraj

Linked List - Addition before a node

Tries

Introduction to Bubble Sort

Stacks - Additions and Deletions

Heaps

In Place Heap Sort

Kruskals Algorithm

Dijkstra Algorithm - Example

Linear Search

Binary Search Tree - Deletion

Implementation of Linked Lists

Introduction to Double Ended Queues

Suffix Tries

Introduction to Circular Queues

Circular Queues - Additions and Deletions

Binary Search Tree - Search Pseudo Code

Depth First Search - Pseudo Code

Hashing - Double Hashing

Hashing - Compression Map

Binary Search Tree - Insertion Pseudo Code

Hashing - Linear Probing

Dijkstra Algorithm

Compressed Tries

Heaps - Bottom Up Construction

Heap Sort

Introduction to Hashing

Depth First Search - Part 2

AVL Tree - Single Rotation

Binary Search Tree - Search Complexity

Huffman Encoding

Implementation of Binary trees

Graphs

Introduction to Selection Sort

Trees - Depth

Encoding Tries

AVL Tree - Deletion

Depth First Search - Part 1

Breadth First Search - Pseudo Code

Binary Search Tree

Linked List - Addition before a node

Hashing - Separate Chaining

Introduction to Queues

Breadth First Search

Hashing - Quadratic Probing

Insertion Sort - Pseudo Code

AVL Tree - Insertion

Prim's Algorithm

Hashing - Bloom Filter

AVL Tree - Double Rotation