Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
- 21 Answers
- 27453 Views
- ABC, Sun Microsystems, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / wavelet
Binary tree is different from binary search tree(BST)!!
| Is This Answer Correct ? | 6 Yes | 2 No |
write a c++ to define a class box with length,breadth and height as data member and input value(),printvalue() and volume() as member functions.
what's the difference between abstract class and concreate class? what's the meaning of standard template library(STL)?
Distinguish between: a) Normal layout & Print Layout views b) Windows Clipboard & office Clipboard c) Save & Save As Commands d) Program File & Data File e) Pie Charts & Barr Charts
how to swap two numbers in a linked list without exchanging the data but only the links?
i want a road rash 3d game code if some one know please help me
HOW TO GET "H1B" -VISA 4 USA FOR MY SON?HE HAD COMPLETED "MS"(IT)FROM AUSTALIA 2007.I AM WORKING IN U.S.A.
What do you mean by stl?
How do you convert stl to steps?
method overloading means what?
What Is Operator Overloading in C++?
Diffrernce Between Overloading and Overriding?
What are the different types of stl containers?
STL 
