By parsing/processing the nodes we attain O(n) to O(log(n)) depending on

How can you find the nodes with repetetive data in a linked
list?

Question Posted / murali

Answer Posted / murali

By parsing/processing the nodes
we attain O(n) to O(log(n)) depending on the type of data-
structure

Is This Answer Correct ?

2 Yes

9 No

Please Help Members By Posting Answers For Below Questions

What is a static member?

1007

Define macro.

1035

Where do I find the current c or c++ standard documents?

1039

why is c++ called oops? Explain

997

Describe Trees using C++ with an example.

1099

Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?

958

How is computer programming useful in real life?

1014

Explain the concept of copy constructor?

990

What do you understand by a pure virtual member function?

948

Explain "const" reference arguments in function?

1002

What are member functions used in c++?

1088

Can a program run without main function?

1100

Does c++ support multilevel and multiple inheritances?

957

Which software is used to run c++ program?

956

What does count ++ do in c++?

1165