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

How we can differentiate between a pre and post increment operators during overloading?

Can you use the function fprintf() to display the output on the screen?

What is the difference between while and do while loop? Explain with examples.

How would you use qsort() function to sort an array of structures?

When we use Abstract Class and when we use Interface?where we will implement in real time?

If dog is a friend of boy and boy is a friend of house, is dog a friend of house?

Explain the difference between realloc() and free() in c++?

Explain how to initialize a const member data.

What are the techniques you use for debugging?

Can java be faster than c++?

What is the size of a vector?

Can create new c++ operators?

For more C++ General Interview Questions Click Here