Insert an Element

Enter a number and choose an option to add it to the linked list.

Delete an Element

This operation has the foundation of a Queue. The first element to enter is the first to exit.

This exclusion at the end addresses the concept of a Stack. The last element to enter is the first to exit

Search for an Element

Verify if the value is present in the list.

Is the value included in the list?

What is the next node?

Insert in a Specific Position (by Index)

This method should insert a new Node with the given element at the position specified by index.

Remember that the first element is at the zero position

Delete in a Specific Position (by index)

This method, just like index insertion, will locate the node before the index to be deleted and modify the pointers.

Remember that the first element is at the zero position

Manipulation/Transformation

The order of the list will be reversed by changing the next pointers of each node.

Check your output section

Output

Singly Linked List: { }

Size of the List: 0