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 |
sir please send me bpcl previous question papers
0 Answers BPCL Bharat Petroleum,
To modify an, existing worksheet. What steps are involved for: 1. Inserting and deleting rows and columns. 2. Printing cell formulas 3Jld displayed values 3. Using the page setup command
if 4-5 year old brother is standing on d roof with me and watching d moon, suddenly moon coverd by cloud then how will i explain d hiding of moon to my brother.
How Find, Replace and Go To commands ca be used to substitute one character string for another? Explain with the heIp of an example.
Write a program to print the swapping in two no and using three variable.
how to use C++?
What are the symptoms of stl?
How do you convert stl to steps?
In what cases using of a 'template' is a better approach then using of a 'base class'?
6 Answers Lucent, Mind Tree, Wipro,
What is the STL?
what are you now programming Languages C+
why & sign is used in copy constructor