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 |
please visit this site you'll find my question this is my homework please answer it if you can http://easyscience.org/ib/lofiversion/index.php/t36168.html
When did c++ add stl?
give me the defination of inheritance?
Describe how to safeguard a system through acquisition of an antivirus Program and systematic backup.
totoo po ba ang manga aliens!
what's the difference between function overloading and function overiding?
I am doing my BS.c MATHS CAN I ABLE TO JOIN IN NIIT?
write a program to convert a decimal number in to its equivalent binary number?
how to get the sum of two integers?
Describe the elements of Microsoft Word screen. Write down steps for creating, saving, retrieving, editing and printing a document.
What is C++ could you enplane me please?
How to write a function that goes through an array of characters and eliminates any elements that are not letters (Legal letters can be either in an uppercase or a lowercase format.) The function removeNonLetters should return the new effective size of the array as the result.