In this problem, you are asked to implement 4 functions:
1. void Create_List(Node**, int);
This function is used to create the linked list according to the input.
2. Node* Delete_Last_Node(Node*);
This function is used to find the last node of the linked list, and delete it.
We have to return the processed linked list.
3. void Print_List(Node*);
This function is used to print out the key value in the linked list.
4. void Free_List(Node*);
This function is used to free the memory space.
The input contains one line of several integers.
The line represents a linked list, and each integer is a node of the linked list.
Each line of input is ended by -1, and you don't need to add a new node with key value -1.
It is guaranteed that:
You need to output the linked list which has been through the deletion of the last node.
Each key value is separated by "->".