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"?
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 is cin clear () in c++?
What is the best c++ book?
Is c++ a float?
What is the difference between while and do while loop?
What is an adaptor class in c++?
What do you mean by overhead in c++?
Why c++ is not a pure oop language?
What is purpose of abstract class?
What's the best free c++ profiler for windows?
What is vector string in c++?
What is a Default constructor?
Explain the term memory alignment?
What is the correct syntax for inheritance a) class aclass : public superclass b) class aclass inherit superclass c) class aclass <-superclass
Explain the difference between using macro and inline functions?
Explain the static member function.