##kernel data structure
###Linked Lists
- Singly Linked List
- Doubly Linked List
- Circular Linked Lists
- Singly
- Doubly (kernel used)
###Queue
###Maps
####Binary trees
-
Binary Search Trees
-
Self-Balancing Binary Search Trees
-
Red-Black Trees (kernel used)
###Others
-
radix trees
-
bitmaps
-
rolling your own
###What data structure to use, When linked list : iterating over all data; store large data(linear)
queue : producer/consumer pattern (FIFO)
Red-Black : store large data and searching (logarithmic)