Trees:
Types:
Binary, full, complete, perfect, BST, sum tree, M-ary(BTree, B+Tree)
LSM(Log structured Merge): Used
in noSQL DB
Comparison
Hash Table vs Self-Balancing Binary Trees
Hash Tables:
DAT(Direct Access Tables), Internal Implementation of HT, Hash
Collision(Solutions: Open Addressing, Seperate Chaining), Rehashing,
Implementations(2-left hashing, d-left hashing), Code
Probabilistic Data Structures:
Why PDS,
Bloom Filter