Lets say that I am storing 10^9 keys in a single BST. Compared to having lets say having multiple BSTs of sizes 10^6 containing chunk of the bigger tree? Search through all of them executing in parallel.I am talking about only search performance here, Given that processing power is not a bottle neck.
Single big BST vs multiple smaller BSTs? Which is faster for search?
time complexity