Key Points Doubly linked list:
A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields and one data field.
Binary tree:
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
Linked list:
A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes that together represent a sequence.
Queue:
A queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence.
A Doubly linked list is the efficient data structure to insert/delete a number in a stored set of numbers.
| Data Structure |
Worst-case time complexity |
| Search |
Insert |
Delete |
| Doubly linked list |
O(n) |
O(1) |
O(1) |
| linked list |
O(n) |
O(1) |
O(n) |
| Binary tree |
O(n) |
O(n) |
O(n) |
| Queue |
O(n) |
O(1) |
O(1) |
Hence the correct answer is the Doubly linked list.
