Programming, Algorithms, Data, Tech, Web Development.
that searching something in 4 million nodes requires log4000000 = ~22 comparisons in the worst case. Back to the tree - Element access time in a binary search tree is O(logN). Why not use hashtables? Hashtables have constant access time, which makes it reasonable to use hashtables almost