•Create a node, with data and next
•Input data in the head part
•Set next to head of another node
•Print the List
•Create a node
•Make function to access List
•Set next to head of another node
•Print the List
•Create a node, with data and next
•Use of pointer is involved
•Set next to head of another node
•Print the List
•Create a node
•Insert at beginning
•Insert at after
•Insert at end
•Delete node
•Print List
•Create a node
•Push items
•Make reverse function
•Print it
•Create a node
•nodes must connect to form a circle
•Push items
•Print it
•Create a node
•Make three parts of node as data, next, prev
•Push items
•Print it