We have discussed different methods of linked list insertion. How to recursively create a linked list?
Recursively inserting at the end:
To create a Linked list using recursion follow these steps. Below steps insert a new node recursively at the end of linked list.
Recursively traversing the list:
The idea is simple, we print current node and recur for remaining list.
Below is complete program to demonstrate working of insert and traverse a linked list.
6 8 10 12 14
This article is contributed by AMIT KUMAR. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Insertion in Unrolled Linked List
- Insertion Sort for Singly Linked List
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Circular Singly Linked List | Insertion
- Doubly Circular Linked List | Set 1 (Introduction and Insertion)
- Insertion at Specific Position in a Circular Doubly Linked List
- Insertion in a sorted circular linked list when a random pointer is given
- Recursive approach for alternating split of Linked List
- Modify contents of Linked List - Recursive approach
- Recursive Approach to find nth node from the end in the linked list
- Recursive function to delete k-th node from linked list
- Check if linked list is sorted (Iterative and Recursive)
- Search an element in a Linked List (Iterative and Recursive)
- Find Length of a Linked List (Iterative and Recursive)
- Circular Linked List | Set 2 (Traversal)