Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list
Answer Posted / 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 |
Post New Answer View All Answers
How stl is different from the c++ standard library?
What is stl in oop?
Do you like to Submit Questions in Bulk under Same Category?? Then use our Bulk ListerDo you like to Submit Questions in Bulk under Same Category?? Then use our Bulk Lister
What is stl stand for?
help me i need a c++ program which takes sequesnce of characters and outputed sequence of their token taypes, work same compiler in lexical analysis phase
Is stl open source?
what is template and type convertion
How do I convert a stl file?
i wanted to know about questions about c,c++ , which is required for placements.... im a fresher
Is stl part of c++ standard?
What do stl stand for?
What are the various types of stl containers?
How do you convert stl to steps?
totoo po ba ang manga aliens!
sir please send me bpcl previous question papers