605 views

1 Answer

0 votes
0 votes
all dictionary operations  INSERT, SEARCH and DELETION will be done in O(n) time.

Related questions

1 votes
1 votes
2 answers
2
akash.dinkar12 asked Jun 30, 2019
386 views
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
1 votes
1 votes
1 answer
3
akash.dinkar12 asked Jun 30, 2019
392 views
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
0 votes
0 votes
1 answer
4
akash.dinkar12 asked Jun 30, 2019
497 views
Can you implement the dynamic-set operation $INSERT$ on a singly linked list in $O(1)$ time? How about $DELETE$?