Insert a Node at the Tail of a Linked List

  • + 0 comments

    thanks! nice one! you can reduce complexity by removing while loop there, because anyway in recursion head moves as you pass newn2->next, so no need to check the condition whether it is pointing to the extreme