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"?
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / santosh patil
just copy elements from 5th to 4th den 6th to 5th n so
on.....at last delete the last node r set it to null
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / codeg
it is not possible in Single AND double linked list without
traversing from first and not knowing addr of 4..
its possible in circular doubly linked list only........
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / pradeep
its possible only if it is a doubly linked list.
Is This Answer Correct ? | 3 Yes | 6 No |
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 |
What is heap sort in c++?
Declare a class vehicle and make it an abstract data type.
Explain the difference between realloc() and free() in c++?
Implement a 2 dimensional array by one dimentional array
What is c++ course?
Write a program to calculate the BMI of a person using the formula BMI = weight/height2.
What is virtual constructor paradigm?
What is unary operator? List out the different operators involved in the unary operator.
How a new element can be added or pushed in a stack?
What is friend class in c++ with example?
What is a Default constructor?
Can we use this pointer inside static member function?