The use of COBOL cripples the mind; its teaching should therefore be regarded as a criminal offense. E.W. Dijkstra
Doubly linked list is a linked data structure that consists of a set of sequentially linked nodes. Each node contains two links (references to the previous and to the next node) and data. The links help to iterate the node forward and backward.
XOR-linked list allows doubly linked list to be implemented using a single link field in each node. The XOR linked list decrease the memory size compare than doubly linked list. The XOR linking has few drawbacks and it is difficult to debug using debugging tools.
Write a program to implement doubly ended linked list with all the operations.
insert at front: 9, 56, 74 List : 74->56->9->NULL insert at rear: 34, 47, 99 List : 74->56->9->34->47->99->NULL Delete first item from List Delete last item from List List : 56->9->34->47->NULL Delete item '34' from List List : 56->9->47->NULL insert 11 after 9 in List List : 56->9->11->47->NULL