Which of the following data structures is on average the
fastest for retrieving data:
1) Binary Tree
2) Hash Table
3) Stack
- 3 Answers
- 12049 Views
- I also Faced
- E-Mail Answers
Answer Posted / jbo5112
It depends on what you're looking for. If you want to find
what you just inserted, then a stack would be best. If you
have some sort of key that you're using to search through
the data, then it depends.
A hash table will generally be better, like Shruti said, but
if your container has few values and your key is large, then
doing a binary search might be faster than computing a hash
value for your key. That, of course, requires your Binary
Tree to be sorted and at least somewhat optimized (not all
branching the same direction). If your data is mostly
ordered, it's also possible to optimize your binary tree
search based on your previous search, but that will slow
down random data. I personally use hash tables or...
A fourth option (if memory permits) is to convert your key
to an integer and use an array. This one is quite easy to
implement (Boost even has one that is STL compliant, w/o
vector's overhead), and unless memory cache sizes come
heavily into play, this one is unbeatable. An example would
be looking up a state's name by the two letter abbreviation.
An array of 32768 char*'s isn't much, and on most computers
(including any x86/x86_64) you can simply look it up by
array[*(int*)"NY"].
| Is This Answer Correct ? | 21 Yes | 0 No |
Post New Answer View All Answers
What does dm mean sexually?
What is a structure and why it is used?
What is typedef example?
Is null valid for pointers to functions?
Can you explain what keyboard debouncing is, and where and why we us it? please give some examples
What are the valid places to have keyword “break”?
What does nil mean in c?
Is fortran still used in 2018?
What are unions in c?
What are preprocessor directives in c?
Why do we use namespace feature?
How is a pointer variable declared?
Explain 'bus error'?
What are the application of c?
Explain indirection?
