Question

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

Delete the first element

Insert a new element as a first element

Delete the last element of the list

Add a new element at the end of the list

​

Answer 1

Answer:

Answer:Delete the last element of the list

Answer 2

Answer:

Deletion of the first element of the list is done in O (1) time by deleting memory and changing the first pointer.

Explanation:

Deletion of the first element of the list is done in O (1) time by deleting memory and changing the first pointer. Insertion of an element as a first element can be done in O (1) time.

We will create a node that holds data and points to the head of the given linked list.

The head pointer was changed to a newly created node. Deletion of the last element requires a pointer to the previous node of last, which can only be obtained by traversing the list.

This requires the length of the linked list. Adding a new element at the end of the list can be done in O (1) by changing the pointer of the last node to the newly created node and last is changed to a newly created node.

To learn more about similar questions visit:

https://brainly.in/question/1291443?referrer=searchResults

https://brainly.in/question/1275122?referrer=searchResults

#SPJ2