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
- 13583 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
Explain what is the general form of a c program?
Write a program which returns the first non repetitive character in the string?
What is a spanning Tree?
How can my program discover the complete pathname to the executable from which it was invoked?
How do I create a directory? How do I remove a directory (and its contents)?
What are the scope of static variables?
What is difference between union and structure in c?
Can we compile a program without main() function?
Difference between Shallow copy and Deep copy?
Why void main is used in c?
What is calloc()?
Explain the red-black trees?
How to write a multi-statement macro?
What is array of structure in c?
Explain 'bus error'?
