its possible only if it is a doubly linked list.

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"?

Question Posted / pradeep

6 Answers
8779 Views
CSC, I also Faced
E-Mail Answers

Answer Posted / pradeep

its possible only if it is a doubly linked list.

Is This Answer Correct ?

3 Yes

6 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

When are exception objects created?

1075

Explain what data encapsulation is in c++?

1096

Is overriding possible in c++?

1005

What are c++ tokens?

1053

Is turbo c++ free?

1072

Can class objects be passed as function arguments?

1066

What is a container class?

1139

Can I learn c++ in a week?

1066

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)

1942

What causes a runtime error c++?

1125

Does c++ support multilevel and multiple inheritances?

1005

What is function overriding in c++?

1067

What are the different types of comments allowed in c++?

989

Will this c++ program execute or not?

1089

How const int *ourpointer differs from int const *ourpointer?

1130