A natural number N is read, followed by N integer values read one at a time. Build a singly linked list with dynamic allocation such that after each insertion the list remains sorted in ascending order. For equal values, the relative order does not matter.
At the end, print the values in the list by traversing it from head to tail, separated by single spaces, followed by a newline.
Use a structure Node { int val; Node* next; } with new for allocation. Do not use STL containers.
The first line contains `N`. The second line contains the `N` values separated by spaces. - `1 <= N <= 1000`; - values are integers, `-1_000_000 <= val <= 1_000_000`.
The program prints on a single line the values from the list in ascending order, separated by single spaces.
5 3 1 4 1 5
1 1 3 4 5
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
5 3 1 4 1 5
1 1 3 4 5
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
