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
- 6968 Views
- CSC, I also Faced
- E-Mail Answers
Answer Posted / truong nguyen
Memory address of all elements in a linked list are not
continuous. So if we only know the memory address of the
element "4", we cannot know memory address of element "3"
and "5" without traversing. And we cannot remove it from the
linked list.
| Is This Answer Correct ? | 1 Yes | 4 No |
Post New Answer View All Answers
What are separators in c++?
Array base access faster or pointer base access is faster?
Is c++ the hardest programming language?
What are the uses of typedef in a program?
What do you mean by translation unit in c++?
Which is better c++ or java?
Can we define a constructor as virtual in c++?
Why c++ is not a pure oop language?
What are structures and unions?
Explain the scope of resolution operator.
Difference between declaration and definition of a variable.
What is private public protected in c++?
What is c++ good for?
Explain how to initialize a const member data.
What is a buffer c++?
