Dynamic Pointer-Based Binary Search Trees.

So, Whats the best data structure we know? is it BST's with log n? or is it hash tables with constant time in most cases, well hash tables are good, collisions are bad!! so why not just find a way to store data with another layer which reduces time complexity. so the idea of DPB-BSTs is that, we hav... View More