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 / 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
Does a derived class inherit or doesn't inherit?
How are the features of c++ different from c?
What is a flag in c++?
What is c++ runtime?
How can you quickly find the number of elements stored in a a) static array b) dynamic array ? Why is it difficult to store linked list in an array?how can you find the nodes with repetetive data in a linked list?
Which format specifier is used for printing a pointer value?
what is C++ exceptional handling?
the maximum length of a character constant can be a) 2 b) 1 c) 8
What is a string example?
What is the difference between public, private, and protected access?
What are the operators in c++?
What is binary object model?
What is setbase c++?
Explain the benefits of proper inheritance.
What do you mean by volatile and mutable keywords used in c++?