Interested to Buy Any Domain ? << Click Here >> for more details...
Which of the following data structures is on average the
fastest for retrieving data:
1) Binary Tree
2) Hash Table
3) Stack
- 3 Answers
- 13706 Views
- I also Faced
- E-Mail Answers
Answer Posted / k.kavitha
3)stack
| Is This Answer Correct ? | 8 Yes | 23 No |
Post New Answer View All Answers
Write a program to print fibonacci series using recursion?
What are preprocessor directives in c?
What is #define?
What are the header files used in c language?
Explain About fork()?
Explain a pre-processor and its advantages.
please send me the code for multiplying sparse matrix using c
Which control loop is recommended if you have to execute set of statements for fixed number of times?
What is static identifier?
Do array subscripts always start with zero?
When reallocating memory if any other pointers point into the same piece of memory do you have to readjust these other pointers or do they get readjusted automatically?
What does c mean before a date?
What is modifier & how many types of modifiers available in c?
what is the c source code for the below output? 5555555555 4444 4444 333 333 22 22 1 1 22 22 333 333 4444 4444 5555555555
What is the size of structure in c?
