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

In c++, what is the difference between method overloading and method overriding?

1197

Is c the same as c++?

1061

What is a hash function c++?

1121

Is c++ a good first language to learn?

1121

How many different levels of pointers are there?

1280

What problems might the following macro bring to the application?

1099

what are function pointers?

1142

Explain the register storage classes in c++.

1230

What is expression parser in c++

2564

What header file is needed for exit(); a) stdlib.h b) conio.h c) dos.h

1110

Why is c++ awesome?

1085

Reverse the Linked List. Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL

851

Write a program to find the Factorial of a number

1120

What is the difference between global variables and local variable

1120

What is abstract keyword in c++?

1122