Final List (review in the 2 days before the interview)

Data Structures:
Iterator
Smart Pointers
Linked List
Doubly Linked List
Queue
Stack
Deque
Hash Table
Heap
Binary Tree
BST
Red-Black Tree
AVL-Tree
B Tree
Priority Queue
Trie
Union-Find
Skip List
Graph
Bloom Filter
Splay Tree
Suffix Tree
Given a binary tree, make it behave as a list.


General (Design):
Search Suggestion of Google Search Engine