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

How does work in c++?

1131

How can an improvement in the quality of software be done by try/catch/throw?

1140

What does flush do c++?

1120

When we use Abstract Class and when we use Interface?where we will implement in real time?

2237

What is c++ code?

1176

why is c++ called oops? Explain

1098

Describe the advantages of operator overloading?

1079

Is c++ faster than c?

1081

What are the restrictions apply to constructors and destructors?

1120

When do we run a shell in the unix system? How will you tell which shell you are running?

1023

What is fixed in c++?

1081

What is iomanip c++?

1112

What is a string example?

1143

Why is c++ awesome?

1083

What is a vector c++?

1250