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 storage class used in c++?

1079

What is the difference between an array and a list?

1033

What kind of problems can be solved by a namespace?

1096

How a new operator differs from the operator new?

1124

Define the operators that can be used with a pointer.

1060

What are advantages of using friend classes?

1076

What is near, far and huge pointers? How many bytes are occupied by them?

1119

Can we make copy constructor private in c++?

1058

How can a called function determine the number of arguments that have been passed to it?

1140

What is pair in c++?

1067

What are the methods of exporting a function from a dll?

1233

What number of digits that can be accuratly stored in a float (based on the IEEE Standard 754)? a) 6 b) 38 c) An unlimited number

1275

How to tokenize a string in c++?

1062

What are the benefits of pointers?

1038

What is static class data?

1061