Linked List Stack Queue array

Create

Insert

Remove

Random

GO

GO

Insert at Random

GO

nsert New Head

GO

Insert Tail

GO

Remove Head

Remove Tail

Remove any element

GO

Footer Design
Linked list is a data structure consisting of a group of vertices which together represent a sequence. Under the simplest form, each vertex is composed of a data and a reference (in other words, a link) to the next vertex in the sequence.
Next
To toggle between the Linked List, Stack, Queue, Doubly Linked List, and Deque, select the respective header.
Next
All available operations will be shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.
Next
View the visualisation here!
Next
As the action is being carried out, each step will be described in the status panel.
Next
You can also follow the psuedocode highlights to trace the algorithm.
Next
Control the animation with the player controls! Keyboard shortcuts are:
Spacebar: play/pause/replay
Left/right arrows: step backward/step forward
-/+: decrease/increase speed
Next
Return to "Exploration Mode" to start exploring!