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
- 6983 Views
- CSC, I also Faced
- E-Mail Answers
Answer Posted / mpoleg
1) copy content of element 5 to element 4
2) link element 4(which already contains number 5) to
element 6
3) delete element 5
| Is This Answer Correct ? | 10 Yes | 1 No |
Post New Answer View All Answers
Do you know what are static and dynamic type checking?
how to connect with oracle 9i with server in socket program in c/c++
Can member functions be private?
How is c++ used in the real world?
Is it possible to use a new for the reallocation of pointers ?
Can we inherit constructor in c++?
What are c++ templates used for?
Which is the best c++ compiler for beginners?
What is a stack? How it can be implemented?
What is the need of a destructor? Explain with the help of an example.
How many types of scopes are there in c++?
What is the header file for setw?
Why are pointers used?
What are the advantages of using friend classes?
what is a reference variable in C++?
