Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
Answer Posted / splurgeop
the correct answer is binary tree.........since a binary
tree has the property that that the left subtree will
always be smaller than the root subtree.so our searchinin
will be refined at each step i.e either we have to search
the left subtree or the rioght subtree.....and this
continuess tilll we either find the element or we find get
to the leaf node and dont find the element(element doest
not exist)...
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Write a C/C++ program to add a user to MySQL. The user should be permitted to only "INSERT" into the given database.
Describe the My Computer and My Documents folders; identify the elements that are present in every Window.
What are the symptoms of stl?
Do you like to Submit Questions in Bulk under Same Category?? Then use our Bulk ListerDo you like to Submit Questions in Bulk under Same Category?? Then use our Bulk Lister
How is stl different from c++ standard library?
What are the components of stl?
How do you convert stl to steps?
What is stl stand for?
Why should a c++ programmer be interested in stl?
How connect plc and pc through software
Define stl.
Is stl part of c++ standard?
What is a standard template library (stl)? What are the various types of stl containers?
What is stl language?
what is template and type convertion