Introduction to Linked List
Implement a singly linked list with insertion, deletion, and traversal operations.
Input format
The first line contains N — the number of nodes. The second line contains the N node values in list order.
Output format
Build the linked list from the values and print its traversal from head to tail, space-separated.
Constraints
- Values fit in a 64-bit signed integer
- Trailing whitespace and a trailing newline are ignored by the judge
Read from stdin, write to stdout. Sample cases below show the exact format.
Sample cases
Example 1
Input
5
1 2 3 4 5Expected output
1 2 3 4 5Example 2
Input
1
9Expected output
9