COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Stack
|
|
|
Binary Search Tree
|
|
|
Graph
|
|
|
Queue
|
Detailed explanation-1: -Explanation: The answer is Queue. Queue is a data structure in which insertion takes place from one end, and deletion takes place from one end.
Detailed explanation-2: -Enqueue()-Insertion of elements to the queue. Dequeue()-Removal of elements from the queue. Peek()-Acquires the data element available at the front node of the queue without deleting it. isFull()-Validates if the queue is full.
Detailed explanation-3: -It has two operations enqueue and dequeue. Enqueue is used to insert the element and dequeue is used to delete the element from the queue.
Detailed explanation-4: -The insertion of an element in a queue is called an enqueue operation and the deletion of an element is called a dequeue operation.
Detailed explanation-5: -A queue is a linear data structure in which an element is inserted only at one end of the queue and deletion only at other end of the queue. A queue is based on first in first out (FIFO) property i.e. element inserted first will be the first one to be deleted.