<P> These symmetric functions insert a node either after or before a given node: </P> <P> We also need a function to insert a node at the beginning of a possibly empty list: </P> <P> A symmetric function inserts at the end: </P> <P> Removal of a node is easier than insertion, but requires special handling if the node to be removed is the firstNode or lastNode: </P>

Difference between circular and doubly linked list in data structure