Insert a Node at the Tail of a Linked List

1. 문제

2. 알고리즘

키워드 - 구현, 링크리스트

3. 코드

/*
  Insert Node at the end of a linked list 
  head pointer input could be NULL as well for empty list
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
Node* Insert(Node *head,int data)
{
  // Complete this method
    Node* node = new Node();
    node->data = data;
    node->next = NULL;
    
    if (head == NULL) {
        head = node;
        return head;
    }
    
    Node* first = head;
    while (head->next) head = head->next;
    head->next = node;
    return first;
}