Match the structures and phrases on the left with the definitions on the right. Note - there are more definitions than needed. Queue Stack Order of Magnitude enqueue Array pop Linked List peek dequeue Heap Doubly Linked List push Priority Queue A. A data structure that takes the form of a binary tree which is used to store data efficiently to get the max or min element. B. A linked data structure in which navigation is possible in both ways - forward and backwards. C. A sequential data structure whose operations are performed in Last In First Out (LIFO) order. D. A data structure doubles in size each time an element is added. E. A mathematical notation that describes the order in which elements of a data structure are stored. F. A sequential data structure whose operations are performed in a custom-sorted order. G. A data structure containing items of same data type stored sequentially at contiguous memory locations. H. A sequential data structure whose operations are performed in First In First Out (FIFO) order. I. A linked data structure where each node contains a data field of interest and a reference to the next node in the list. J. A mathematical notation that describes the time complexity of algorithms. K. Operation that returns a reference to the next element to be returned from a data structure. L. Operation that removes and returns the next element to be returned from a LIFO data structure. M. Operation that removes and returns the next element to be returned from a FIFO data structure. N. Operation that adds an element to a FIFO data structure. O. Operation that adds an element to a LIFO data structure. P. Operation that removes and returns an element from a sequential data structure at a specific index.