Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 8775 Views
- CSC, I also Faced
- E-Mail Answers
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
Describe public access specifiers?
What is diamond problem in c++?
What is binary search in c++?
What is do..while loops structure?
Write a single instruction that will store an EVEN random integer between 54 and 212 inclusive in the variable myran. (NOTE only generate EVEN random numbers)
What do you mean by a template?
Write a program in C++ for Fibonacci series
what is scupper?
What is the difference between an external iterator and an internal iterator? Describe an advantage of the external iterator.
Does c++ have string data type?
Explain object slicing in c++?
Explain the different access specifiers for the class member in c++.
What is vector string in c++?
What is jump statement in C++?
What are the advantages of early binding?
