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
How can I learn c++ easily?
What is anonymous object in c++?
What number of digits that can be accuratly stored in a float (based on the IEEE Standard 754)? a) 6 b) 38 c) An unlimited number
What apps are written in c++?
How can you tell what shell you are running on unix system?
What does the ios::ate argument do?
Describe public access specifiers?
Name four predefined macros.
write a programme to get a character and thier ASCII value
What is jump statement in C++?
How much do c++ programmers make?
How a pointer differs from a reference?
When should we use multiple inheritance?
Explain what are mutator methods in c++?
Is c++ proprietary?