So, instead of doing all these recursive solutions and what not, why not simply traverse each of the two linked lists first and compute the actual integer value of each. We then add the two integers, which is O(1). We can then simply construct the final linked list based on the sum. Wouldn't it be much simpler and just as efficient?