Which data structure gives efficient search?

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

Answer Posted / rajesh

B-tree/B+tree is the right answer.

Is This Answer Correct ?    4 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What do stl stand for?

636


Q1. A. What is unary operator? List out the different operators involved in the unary operator. B. What is an adjust field format flag? Q2. A. Distinguish between a # include and #define. B. Can a list of string be stored within a two dimensional array? Q3. A.Explain how a pointer to function can be declared in C++? B.List the merits and demerits of declaring a nested class in C++? Q4. A. What are the syntactic rules to be avoid ambiguity in multiple inheritence? B. Explain the operation of overloading of an assignment operator. Q5. A. Explain how the virtual base class is different from the conventional base classes of the opps. B. Explain how an exception handler is defined and invoked in a Program. Q6. A. What is a binary file? List the merits and demerits of the binary file usagein C++. B. Write short notes on Text Manipulation Routines. C. Write bites in Turbo c++ Header (“Include”) Files.

2307


Is stl part of c++ standard?

637


How connect plc and pc through software

1915


What are the symptoms of stl?

600






When did c++ add stl?

729


Define stl.

771


i wanted to know about questions about c,c++ , which is required for placements.... im a fresher

1697


How stl is different from the c++ standard library?

639


What is stl stack?

658


Why should a c++ programmer be interested in stl?

638


Explain stl.

902


What is a standard template library (stl)? What are the various types of stl containers?

667


Is there any error below, its a code to delete all entires from a map #include #include iostream.h int main() { int i =0; map TestMap; while(i<3) { TesMap.insert(TestMap::value_type(i,Test)); i++; } typedef map :: iterator mapIter =TestMap.begin(); if(mapIter!=TestMap.end()) { TestMap.erase(mapItrer); ++mapIter; } return 0; }

1889


write a program that will accept a number and print.its equivalent in words the maximum input number is 9999

2497