Description

This is data structure homework 2.

In this homework, you are asked to implement linked list operations.

Input

Commands, following by arguments if necessary. 

e.g. InsertBack 

InsertFront 0 ,

PrintChain  

Reverse

DeleteBack

InsertBefore 9 3

 

0 < Node_id < 100000

For rotate,  0 < k < 100000

 

Output

Whenever PrintChain is called, print every element in the list

e.g. 1->2->3->4->5
 

 

Sample Input  Download

Sample Output  Download

Partial Judge Code

12021.cpp

Partial Judge Header

12021.h

Tags

Add Tag

Discuss