Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 8809 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 is the sequence of destruction of local objects?
What do you mean by inheritance in c++? Explain its types.
Is c++ pass by reference or value?
Explain selection sorting. Also write an example.
Explain register storage specifier.
What is pointer to array in c++?
What are c++ manipulators?
What do you mean by friend class & friend function in c++?
Write about c++ storage classes?
What are the vectors in c++?
You run a shell on unix system. How would you tell which shell are you running?
Define private, protected and public access control.
How do you remove an element from a set in c++?
Using a smart pointer can we iterate through a container?
What is #include iostream h in c++?
