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

write a programme to get a character and thier ASCII value

2598

What is object in c++ example?

630

What are the benefits of oop in c++?

593

What is a manipulator in c++?

717

How to declare a function pointer?

583

Do you know what are the new features that iso/ansi c++ has added to original c++ specifications?

562

Is dev c++ free?

616

Describe new operator and delete operator?

632

Explain container class.

689

How do you establish an is-a relationship?

625

Difference between Abstraction and encapsulation in C++?

580

Is oops and c++ same?

580

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

792

What is a local variable?

582

How to allocate memory dynamically for a reference?

546