Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
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
When did c++ add stl?
What is stl in c++ with example?
What is a standard template library (stl)? What are the various types of stl containers?
What does stl mean in slang?
What is a stl vector?
What is stl stack?
What are the symptoms of stl?
How stl is different from the c++ standard library?
What do stl stand for?
Why should a c++ programmer be interested in stl?
What is stl language?
What is a list in c++ stl?
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
What two types of containers does the stl provide?
Is string part of stl?