We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Data Structures
  3. Linked Lists
  4. Insert a Node at the Tail of a Linked List
  5. Discussions

Insert a Node at the Tail of a Linked List

  • k_pradeep + 1 comment

    Below approach is with recursion

    Node Insert(Node head,int data) {
    return insertDS(head, data, head);
}
Node insertDS(Node head, int data, Node parent){
	if(head == null){
		head = new Node();
		head.data = data;
		if(parent != null) parent.next = head;
	}else
		insertDS(head.next, data, head);
	return head;
}
    • prem_hackerrank + 0 comments

      @k_pradeep
      What is the significance of this line: if(parent != null) parent.next = head;