AMCAT Data Structures and Algorithms

Question 1

Which data structure operates on a Last In, First Out (LIFO) principle?

Accepted Answer

Stack

Answer

A stack follows LIFO, where the last element added is the first one removed.

Question 2

What is the worst-case time complexity of Binary Search?

Accepted Answer

O(log n)

Answer

Binary Search repeatedly halves the search space, giving O(log n) worst-case complexity.

Question 3

Which traversal of a Binary Search Tree visits nodes in sorted ascending order?

Accepted Answer

In-order

Answer

In-order traversal (left-root-right) visits BST nodes in ascending sorted order.

Question 4

What is the maximum number of nodes in a binary tree of height h?

Accepted Answer

2^(h+1) − 1

Answer

A full binary tree of height h has at most 2^(h+1) − 1 nodes.

Question 5

Which data structure is best suited for implementing a priority queue?

Accepted Answer

Heap

Answer

A heap efficiently supports insertion and extraction of the minimum/maximum element in O(log n).

AMCAT Practice Test