Write a recursive routine to add two numbers stored in Linked List in O(n) time and return result in List 3
Lists are not to be reversed. Example: List 1 : 1 > 2 > 3 > 4 > 5 (Num1 - 12345) List 2 : 6 > 7 > 8 (Num2 - 678) List 3 (output) - 1 > 3 > 0 > 2 > 3 (12345 + 678) -- Regards, Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.