Data Structure Solved MCQs

What is the worst-case time complexity for inserting 𝑛 elements into an empty linked list, while maintaining it in sorted order?

Which data structure is used to convert the infix to prefix notation?

Which of the following statements is false about a priority queue?

Which one of the following is the size of int arr[8] assuming that int is of 2 bytes?

The tango tree is a type of:

Which of the following is the correct method to increment the rear pointer in a circular queue?

What is the prefix notation of the expression X + Y * Z?

A ……… does not keep track of address of every element in the list.

If the stack is implemented using the linked list then Which one of the following node is considered the top of the stack?

In the worst case, how many comparisons are required to search for an element in a singly linked list of length 𝑛?

Which of the following statements is incorrect about a Binary Search Tree (BST)?

Which of the following highly uses the concept of an array?

Which of the following is the correct way of declaring an array?

Which data structure is used in breadth first search of a graph to hold nodes?

The time complexity of enqueue operation in Queue is…..?

Which of the following sorting algorithms is best suited to sort a randomly linked list with the lowest time complexity?

A ….. is a directed tree in which outdegree of each node is less than or equal to two?

The five items: A, B, C, D, and E are pushed onto a stack, starting with A. Four items are then popped from the stack and inserted into a queue. Next, two items are deleted from the queue and pushed back onto the stack. If one item is now popped from the stack, what will the popped item be?