B(B+) tree is the correct answer. This is a method which is used to store

Which data structure gives efficient search?

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

Question Posted / verbeek

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

Answer Posted / verbeek

B(B+) tree is the correct answer. This is a method which is
used to store records in file system and has a very high
efficiency. Within very few level of depth of the tree( <10)
you can store over million records and therefore the search
becomes very fast.

Is This Answer Correct ?

2 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

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

2185

help me i need a c++ program which takes sequesnce of characters and outputed sequence of their token taypes, work same compiler in lexical analysis phase

2386

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

2215

What does stl mean in slang?

1122

What do stl stand for?

1146

How connect plc and pc through software

2487

sir please send me bpcl previous question papers

2403

Describe the My Computer and My Documents folders; identify the elements that are present in every Window.

2535

What are the different types of stl containers?

1150

What is the stl, standard template library?

1094

What are the components of stl?

1113

What is stl language?

1152

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; }

2393

how to making game in c++ ?

2726

Is stl open source?

1141