What data structure is fastest, on average, for retrieving data: a) Binary Tr

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

a) Binary Tree

b) Hash Table

c) Stack

Question Posted / surjeet kumar

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

More C++ General Interview Questions

What is the use of turbo c++?

How do you clear a map in c++?

What are function prototypes?

Is c++ platform dependent?

Does c++ cost money?

What are the four partitions in which c++ compiler divides the ram?

What is 'Copy Constructor' and when it is called?

What and all can a compiler provides by default?

Is linux written in c or c++?

Do you know what are pure virtual functions?

What is the use of :: operator in c++?

What is the cout in c++?

For more C++ General Interview Questions Click Here