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 / 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 |
Post New Answer View All Answers
Is turbo c++ free?
How much is c++ certification?
What is the difference between public and private data members?
What are the uses of c++ in the real world?
Where the memory to the static variables is allocated?
In a function declaration what does extern means?
Is overriding possible in c++?
What is time h in c++?
What do you mean by global variables?
What are 2 ways of exporting a function from a dll?
Explain what you mean by a pointer.
Distinguish between a # include and #define.
Write a program for Divide a number with 2 and Print the output ( NOTE: Check for divide by zero error).
Name four predefined macros.
What is array in c++ example?