Data Structures

Covering directly from labels, these are the main topics:


DS concepts
Link list
Double link list
Tree
BST

Arrays


Stack
Queue


Linked List Problems
(Note : By linked list we mean is Singly Linked List)
BST / Binary Search Tree
Traversal


Heap
Priority queue
Priority queue


HASHING

Bloom filter
Bloom filter

Graph Data Structure
What is a graph data-structure?
Cuts of graphs
Minimum cut problem
Graph Representations
Random Contraction Algorithm

Graph Search Algorithms
Graph Search Introduction
BFS - Breadth first search
BFS on tree
Application of BFS -
DFS (Depth first search) for graph

DFS - Depth First Search for tree

Application of DFS -

Balanced BST
Introduction

Red Black Tree
Red Black Tree
Red Black Tree - Insertions
Red Black Tree - Deletions

AVL Tree
Introduction
Insertion of element
AVL Tree - Rotations
Deletion of element

Splay trees


Suffix Trees


Interval Search Tree


Skiplist

Tries

  1. Trie ADT
  2. Implementing trie ADT in java
  3. Inserting in trie
  4. Searching in trie
  5. Trie Operations Complexity

Rope



Resources and References