recategorized by
2,437 views
3 votes
3 votes

Suppose you want to delete the name that occurs before ‘Vivek’ in an alphabetical listing. Which one of the following data structures shall be most efficient for this operation?

  1. Circular linked list
  2. Doubly linked list
  3. Linked list
  4. Dequeue
recategorized by

2 Answers

1 votes
1 votes
Answer B

In given question, we have to search a value and modify the previous node.

Only in doubly linked list we have direct access to previous node
Answer:

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
1 answer
3
go_editor asked Jul 19, 2016
3,376 views
Consider a single perception with weights as given in the following figure:and $f(t)$ is defined as$f(t) \bigg\{ 1, t>0 \: 0, t \leq 0$The above perception can solveOR p...