the correct answer is binary tree. becooooouse it devides the searching p

Which data structure gives efficient search?

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

Question Posted / narendra singh

21 Answers
30962 Views
ABC, Sun Microsystems, I also Faced
E-Mail Answers

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

Is stl open source?

1141

Is there any error below, its a code to delete all entires from a map #include #include iostream.h int main() { int i =0; map TestMap; while(i<3) { TesMap.insert(TestMap::value_type(i,Test)); i++; } typedef map :: iterator mapIter =TestMap.begin(); if(mapIter!=TestMap.end()) { TestMap.erase(mapItrer); ++mapIter; } return 0; }

2392

What is the use of stl?

1095

What is a stl vector?

1265

What is meant by stl in c++?

1152

How is stl different from c++ standard library?

1334

What is stl in c++ with example?

1167

Who wrote stl?

1143

Why should a c++ programmer be interested in stl?

1097

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.

1955

What is a standard template library (stl)?

1133

When did c++ add stl?

1234

What are the different types of stl containers?

1150

What is the stl, standard template library?

1094

What is stl in oop?

1218