may be by using B+ tree it can be solved within O(n) time. checking conditions at the making of tree if index already present or element pointer-1 and pointer+1 positions can be checked .
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
