overview
Visualising Linked List Data Structure

operations
Insert: Add an element to the list.
Delete: Remove an element from the list.

usage

• Enter value to add Node to the end of the Linked List
• Enter value and index to add a node at a specific index
• Click delete to delete the last node
• Enter index to delete a node at a specific index

time complexity
Insert/ Delete Beginning: O(1)
Insert/Delete End: O(n)

Space complexity
O(n)