Say you're dealing with really long integers. They're too long to fit into a regular datatype, so linked lists are used to store them, with each node of the list containing one digit. Now the problem is, given two linked lists, i.e. two really 1/2

Given two linked lists representing long integers, perform addition operation.

• Traverse both linked lists simultaneously, starting from the head.

• Perform addition of corresponding digits and keep track ...read more

Traverse both lists to the end and add preceding zeros in the list with lesser digits. Then call a recursive function on the start nodes of both lists which calls itself for the next nodes of both lis...read more