Answer Posted / vignesh1988i
data structure as i know is a concept of C where we can
easily & logically retrive ur data's without any extra
hardships and thus by saving memory......
thsnk u
| Is This Answer Correct ? | 4 Yes | 7 No |
Post New Answer View All Answers
What do you mean by overflow and underflow?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
What is a tech stack?
What is a queue in data structure?
Give a basic algorithm for searching a binary search tree?
Why arraylist is not efficient for manipulation?
Can we add duplicate keys in a hashmap?
What is the use of sorting the data?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Can we store null in arraylist?
What is the use of hashtable?
Why is it important to sort waste?
Can arraylist hold duplicates?
What is the best data structure and algorithm to implement cache?
Which collection class is thread safe?
