Which data structure gives efficient search?

A. B-tree B. binary tree C. array D. linked list

Answer Posted / narendra singh

the correct answer is binary tree. becooooouse it devides
the searching processing into 2 parts. first left another
one is right side .it will proceed from root if the number
you are searching is smailler than tha root value . it
will search that number to left side and if number is
greater than the root it will go to right side.

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

how can u do connectivity in c++ language? plz send me connectivity code in c++ ?

1898


a program using one dimensional array that searches a number if it is found on the list of given input numbers given by the user and locate its exact location in the list.

1383


Who created stl?

658


What is a list in c++ stl?

697


Can we use stl in coding interviews?

1286






please visit this site you'll find my question this is my homework please answer it if you can http://easyscience.org/ib/lofiversion/index.php/t36168.html

1780


What two types of containers does the stl provide?

573


i wanted to know about questions about c,c++ , which is required for placements.... im a fresher

1704


When did c++ add stl?

742


What are the various types of stl containers?

740


sir please send me bpcl previous question papers

1961


What is meant by stl in c++?

657


What is stl in oop?

686


how to use C++?

2069


Describe how to safeguard a system through acquisition of an antivirus Program and systematic backup.

1648