Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
- 21 Answers
- 24738 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 |
why does the execution of a c++ program start with main()???
What is a list in c++ stl?
why & sign is used in copy constructor
What is Object Oriental Progam
write a program to demonstrate,how constructor and deconstructor work under multilevel inheritance
5. Write c++ function that would intake a string and return the number of occurrences of a given character in that sring Ex:- if the word is “Colombo” and count the occurrences of the letter “o” the function would return 3
What is the Difference between CArray and CList?
1 Answers ProdEx Technologies, Siemens,
Give two integer arrays A & B.A has n elements and B has ' n-1 ' elements . A has all the elements that are there in B. But B has one missing element. Write a function that takes arrays , A & B as imnput and finds the missing element in most optised manner .
Describe the My Computer and My Documents folders; identify the elements that are present in every Window.
sir please send me bpcl previous question papers
0 Answers BPCL Bharat Petroleum,
How do you convert stl to steps?
What is the name of your birth place?
STL 
