P11. Circular Doubly Linked List implementation. Operations: create list, insert item to tail,
insert item to first, insert item to middle (any position),delete any item according to position,
print full list in FORWARD order and REVERSE order.
P12. Basic operations on Stack using Singly Linked List. Identify operations from SLL which suits better
to perform STACK operation and implement the program.
insert item to first, insert item to middle (any position),delete any item according to position,
print full list in FORWARD order and REVERSE order.
P12. Basic operations on Stack using Singly Linked List. Identify operations from SLL which suits better
to perform STACK operation and implement the program.
No comments:
Post a Comment