What data structure is fastest, on average, for retrieving data:

a) Binary Tree

b) Hash Table

c) Stack


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C++ General Interview Questions

What is the use of dot in c++?

0 Answers  


You run a shell on unix system. How would you tell which shell are you running?

0 Answers  


How is new() different from malloc()?

0 Answers  


What is the benefit of learning c++?

0 Answers  


How can we read/write Structures from/to data files?

0 Answers  






What are the advantages of inheritance in c++?

0 Answers  


What do you mean by late binding?

0 Answers  


How can I improve my c++ skills?

0 Answers  


What are the various storage classes in C++?

0 Answers   Fidelity,


What is the purpose of extern storage specifier?

0 Answers  


Describe about storage allocation and scope of global, extern, static, local and register variables?

0 Answers  


How a new element can be added or pushed in a stack?

0 Answers  


Categories