Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
- 21 Answers
- 30991 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 |
What is the STL?
What is a standard template library (stl)?
WHAT IS THE DIFFERENCE BETWEEN C++ AND VC++
write a program that will accept a number and print.its equivalent in words the maximum input number is 9999
what's the difference between abstract class and concreate class? what's the meaning of standard template library(STL)?
What is Object Oriental Progam
What are stl algorithms?
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
What do stl stand for?
i wanted to know about questions about c,c++ , which is required for placements.... im a fresher
Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list
21 Answers ABC, Sun Microsystems,
write a program that input four digit no and finds it is palindrome or not
STL 
