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 are the different types of comments allowed in c++?

0 Answers  


What is the difference between method overloading and method overriding in c++?

0 Answers  


What is the last index number in an array of 100 characters a) 100 b) 99 c) 101

0 Answers  


What is flush () in c++?

0 Answers  


What is meant by forward referencing and when should it be used?

0 Answers  






Define the process of handling in case of destructor failure?

0 Answers  


What is setbase c++?

0 Answers  


What is #include sstream?

0 Answers  


Explain virtual destructor?

0 Answers  


When to use “const” reference arguments in a function?

0 Answers  


What is ofstream c++?

0 Answers  


Write some differences between an external iterator and an internal iterator?

0 Answers  


Categories