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




1) Binary Tree


2) Hash Table


3) Stack

Answer Posted / shruti

hash table

Is This Answer Correct ?    26 Yes 4 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

I heard that you have to include stdio.h before calling printf. Why?

580


What are c identifiers?

617


please give me some tips for the placement in the TCS.

1623


What is union and structure in c?

605


Apart from dennis ritchie who the other person who contributed in design of c language.

801






What is the difference between declaring a variable and defining a variable?

710


What is the difference between pure virtual function and virtual function?

641


What is line in c preprocessor?

606


application attempts to perform an operation?

1487


what are bit fields? What is the use of bit fields in a structure declaration?

1493


What are external variables in c?

537


What is the best style for code layout in c?

624


explain what is fifo?

626


Where local variables are stored in c?

548


Are there any problems with performing mathematical operations on different variable types?

563