1.write C++ pseudocode to manipulate a singly-linked list

2.what are the effects of a set of operations on a stack, queue, and dequeue

3.implementation of a stack using an array or singly linked list.

4.implementation of a queue using circular array or a circularly linked list

5.manipulation of singly linked list and doubly linked list:

Use of 2 classes (node & list itself)

- Insert/remove at the head- Insert/remove at the tail

- Insert/remove in the middle

- Special case of inserting the first node or removing the last node

- Is the list empty- Size of the list