Register

Cormen Edition 3 Exercise 10.2 Question 1 (Page No. 240)

520 views

1 Answer

0 votes
0 votes
insertion at O(1) time in singly linked-list is not possible unless we are using 2 pointers- one containing the starting address and another containing the last address. Similar goes for deletion.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
akash.dinkar12 asked Jun 30, 2019
620 views
Cormen Edition 3 Exercise 10.2 Question 5 (Page No. 240)
Implement the dictionary operations $INSERT$, $DELETE$, and $SEARCH$ using singly linked, circular lists. What are the running times of your procedures?
Implement the dictionary operations $INSERT$, $DELETE$, and $SEARCH$ using singly linked, circular lists. What are the running times of your procedures?
User Avatar
1 votes
1 votes
2 answers
3
akash.dinkar12 asked Jun 30, 2019
405 views
Cormen Edition 3 Exercise 10.2 Question 3 (Page No. 240)
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
User Avatar
1 votes
1 votes
1 answer
4
akash.dinkar12 asked Jun 30, 2019
402 views
Cormen Edition 3 Exercise 10.2 Question 2 (Page No. 240)
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
User Avatar
Link Copied!