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

Show the declaration for a static function pointer.

1060

Explain dangling pointer.

1136

What is c++ redistributable?

1241

Can you please explain the difference between using macro and inline functions?

1056

Is c++ used anymore?

1103

Explain function overloading and operator overloading.

1087

What is the use of setprecision in c++?

1019

What is heap sort in c++?

1078

What is insertion sorting?

1124

What do you mean by global variables?

1083

Why is c++ considered difficult?

1160

Can you please explain the difference between static and dynamic binding of functions?

1040

What do you mean by ‘void’ return type?

1073

What is an adaptor class in c++?

1204

what do you mean by volatile variable?

1064