How will you find the middle node in a linked list? How will you find the node with position 3/4 of the total number of nodes (number of nodes in the list is not known in advance) with low time complexity.
-- 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.
