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 / vishal jagani
yes u can it link list(doubly),....
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
When one must use recursion function? Mention what happens when recursion functions are declared inline?
How can you create a virtual copy constructor?
Can I create my own functions in c++?
What is the use of bit fields in structure declaration?
Define linked lists with the help of an example.
Write about the members that a derived class can add?
How to give an alternate name to a namespace?
What is scope in c++ with example?
What is the difference between an external iterator and an internal iterator?
What does new return if there is insufficient memory to make your new object?
What is the type of 'this' pointer? When does it get created?
Can we use this pointer inside static member function?
Who invented turbo c++?
Can circle be called an ellipse?
What is else syntax in c++?