edited by
1,323 views

1 Answer

0 votes
0 votes

In singly linked list we only goes to forward node  we can't goes back to  backward node because we only have forward pointer which point next node of linked list  but if we want we have to start from head(first node) it may take O(N) time

but in case of doubly linked list we can go to backward node by backward pointer it take O(1).

answer B

edited by

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Mar 27, 2020
907 views
Which of the following is not collision resolution technique?Hash addressingChainingBoth (A) and (B)Indexing
0 votes
0 votes
2 answers
2
go_editor asked Mar 26, 2020
1,098 views
What item is at the root after the following sequence of insertions into an empty splay tree :$1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2, ?$$1$$2$$4$$8$
1 votes
1 votes
3 answers
3
go_editor asked Mar 26, 2020
1,696 views
Suppose we are implementing quadratic probing with a Hash function, Hash $(y)=X$ mode $100$. If an element with key $4594$ is inserted and the first three locations attem...
0 votes
0 votes
2 answers
4
go_editor asked Mar 27, 2020
3,841 views
Code optimization is responsibility of :Application programmerSystem programmerOperating systemAll of the above