Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
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 Object Oriental Progam
why we are using the fork command?.. how it works?
what is the acronym of the term 'C.O.M.P.U.T.E.R' ?
17 Answers Config Systems, Google, Wipro,
Difference between Structure and Class in C++?
What Is Operator Overloading in C++?
Explain References in C++
Write a C/C++ program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the total number of disk writes by MySQL.
What is C++ could you enplane me please?
When did c++ add stl?
What do stl stand for?
how to making game in c++ ?
How stl is different from the c++ standard library?