Can we remove an element in a single linked list without
traversing?
Lets suppose the link list is like this
1 2 3 4 5 6
We need to remove 4 from this list (without traversing from
beginning) and the final link list shud be 1 2 3 5 6
only thing we know is the pointer to element "4". How can
we remove "4" and link "3" to "5"?
- 6 Answers
- 7813 Views
- CSC, I also Faced
- E-Mail Answers
Answer Posted / pradeep
its possible only if it is a doubly linked list.
| Is This Answer Correct ? | 3 Yes | 6 No |
Post New Answer View All Answers
What are the advantages of c++? Explain
Why #include is used?
What function initalizes variables in a class: a) Destructor b) Constitutor c) Constructor
Evaulate: 22%5 a) 2 b) 4 c) 0
What is the c++ programming language used for?
What are static and dynamic type checking?
What is the equivalent of Pascal's Real a) unsigned int b) float c) char
What is struct c++?
What is the use of ::(scope resolution operator)?
Explain what is class definition in c++ ?
If you want to share several functions or variables in several files maitaining the consistency how would you share it?
What is singleton pattern in c++?
Define private, protected and public access control.
What is a breakpoint?
Explain explicit container.
