Which of the following data structures is on average the
fastest for retrieving data:




1) Binary Tree


2) Hash Table


3) Stack

Answer Posted / k.kavitha

3)stack

Is This Answer Correct ?    8 Yes 23 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is difference between constant pointer and constant variable?

616


What is the difference between if else and switchstatement

1306


program to find error in linklist.(i.e find whether any node point wrongly to previous nodes instead of next node)

1616


What are the types of pointers in c?

524


What is anagram in c?

510






How can you access memory located at a certain address?

658


int i=3; this declaration tells the C compiler to a) reserve space in memory to hold the integer value b) associate the name i with this memory location c) store the value 3 at this location d) all the above

734


Write a function expand(s1,s2) that expands shorthand notations like a-z in the string s1 into the equivalent complete list abc...xyz in s2 . Allow for letters of either case and digits, and be prepared to handle cases like a-b-c and a-z0-9 and -a-z. z-a:zyx......ba -1-6-:-123456- 1-9-1:123456789987654321 a-R-L:a-R...L a-b-c:abbc

5051


What is c preprocessor mean?

775


write a c program in such a way that if we enter the today date the output should be next day's date.

1675


What is pass by reference in functions?

315


Can we increase size of array in c?

530


What do you understand by normalization of pointers?

617


What is this infamous null pointer, anyway?

600


Explain how can I right-justify a string?

613