Programming, Algorithms, Data, Tech, Web Development.
structure, and holds elements of the same type (mind JS arrays), so “jumping” to a particular element requires only calculating its relative position to the array’s first element. One thing is very clear. A binary search tree keeps its nodes in sorted order. So what would be the algorithmic