Lalitha Natraj

Linked List - Addition before a node

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

Heaps

Linked List - Addition before a node

Hashing - Bloom Filter

Double Ended Queue - Additions

Introduction to Insertion Sort

Binary Search Tree - Deletion

Hashing - Hash Codes

Insertion Sort - Pseudo Code

Introduction to Binary Search

Quick Sort - Partition

Introduction to Bubble Sort

Quick Sort

Binary Search Tree

Linked List - Deletion at the end

Trees - Depth

Queues - Additions and Deletions

Linked List - Deletion by search

Merge Sort - Merge Algorithm

AVL Tree - Deletion

Recursion Factorial Code

Introduction to Trees

Analyzing Algorithms

Depth First Search - Part 1

Prim's Algorithm

Tries

AVL Tree - Insertion

Hashing - Separate Chaining

Linked List - Addition after a node