Suppose you have a list of N strings. You need to insert them into some in-memory data-structure D so that afterwards, you can check whether any given string is present in D or not. Inserting any string in D need not be fast, but lookup should be fast. Which of these data-structures are appropriate for this purpose:
Answers
Answered by
39
Answer:
I think an array or if...then
Answered by
0
The Answer to the question is :
Linked List Data Structure.
- Data elements in a linked list data structure are linked by a sequence of nodes. Furthermore, each node includes the data items as well as the address to the next node.
- A linked list is a type of linear data structure in which the members are not stored in consecutive memory regions.
- Pointers are used to connect the elements of a linked list.
- Because of their ease of insertion and deletion, linked lists are frequently utilized. Stacks, queues, and other abstract data types can be implemented using them.
SPJ3
Similar questions