Which data structure gives efficient search? A. B-tree B. binary tree C. arra

Categories >> Software >> Programming Languages >> C++ >> STL
Suggest New Category

Which data structure gives efficient search?

A. B-tree B. binary tree C. array D. linked list

Question Posted / guest

21 Answers
27717 Views
ABC, Sun Microsystems, I also Faced
E-Mail Answers

Answers were Sorted based on User's Feedback

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / verbeek

B(B+) tree is the correct answer. This is a method which is
used to store records in file system and has a very high
efficiency. Within very few level of depth of the tree( <10)
you can store over million records and therefore the search
becomes very fast.

Is This Answer Correct ?

2 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / saumil

And Is B-Tree..
See this link
http://searchsqlserver.techtarget.com/sDefinition/0,,sid87_gci508442,00.html

Is This Answer Correct ?

2 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / tony

B-tree.....

Is This Answer Correct ?

1 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / william clausen

It depends... Consider a binary tree which is comprised of
strings based on their number of characters (which is not
out of the question for an application). Now consider
looking for the word "mall" in this binary tree. Where
would it be?

Now consider sorting an array with keys based on the
appearance of characters in the English alphabet. Finding
the word "mall" could be accomplished easily in T(n).

Is This Answer Correct ?

1 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / gaurav singh

BINARY TREE

Is This Answer Correct ?

1 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / narendra singh

the correct answer is binary tree. becooooouse it devides
the searching processing into 2 parts. first left another
one is right side .it will proceed from root if the number
you are searching is smailler than tha root value . it
will search that number to left side and if number is
greater than the root it will go to right side.

Is This Answer Correct ?

0 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / ss

A.B-tREE

Is This Answer Correct ?

0 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / hari

binary tree

Is This Answer Correct ?

0 Yes

0 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / aakriti saxena

array

Is This Answer Correct ?

2 Yes

4 No

Which data structure gives efficient search? A. B-tree B. binary tree C. array D. linked list..

Answer / achu

C.array

Is This Answer Correct ?

5 Yes

17 No

Post New Answer