In: Computer Science
write a few English sentences describing how you would change
the Linked-Chain implementation of the List ADT to support removal
of a node from the middle retaining order.
Write PSEUDOCODE to insert a node at position 2 in a doubly-linked list (assume position follows classic indexing from 0 to item_count - 1)
1. Desribing Linked List Implementation to remove a node from the middle:
2. PSEUDO CODE to insert a node at position 2 in double linked list: