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 the use of volatile variable?

685

How can you quickly find the number of elements stored in a static array? Why is it difficult to store linked list in an array?

663

What is a .h file c++?

610

Can I learn c++ without knowing c?

683

What data encapsulation is in c++?

672

When should I use unitbuf flag?

682

Is c++ a pure oop language?

694

What is abstract keyword in c++?

706

List the advantages of inheritance.

749

What is anonymous object in c++?

723

What are member functions used in c++?

657

What is jump statement in C++?

698

What is unary operator? List out the different operators involved in the unary operator.

673

Do class declarations end with a semicolon?

688

List the features of oops in c++?

660