 Although trivial for a conventional computer, solving this problem by a parallel algorithm is complicated and has been the subject of much research.A balanced tree has similar memory access patterns and space overhead to a linked list while permitting much more efficient indexing, taking O(log n) time instead of O(n) for a random access.However, insertion and deletion operations are more expensive due to the overhead of tree manipulations to maintain balance.