Consider a program that merges two sorted sequences, in linear time (time proportional to the sum of lengths of the two sequences). Which of the following data structures helps to implement the above procedure without allocating extra space?

A

Queue

B

Linked List

C

Stack

D

Arrays

Boost your performance with adaptive practice tests

Practice every concept in the syllabus

Compare your speed and accuracy with your peers

Download the app and practice on the go