DSA + System design - 15

What is the time complexity of searching for an element in a BST?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Given a BST, what is the result of an inorder traversal?

• Nodes are visited in ascending order.

• Nodes are visited in descending order.

• Nodes are visited in random order.

• Nodes are visited level by level.

Which of the following is not a self-balancing binary search tree?

• AVL Tree

• Red-Black Tree

• B-Tree

• Binary Heap

In a BST, which node has the smallest value?

• The root node

• The leftmost node

• The rightmost node

• Any leaf node

Which technique is used to maintain balance in an AVL tree?

• Hashing

• Dynamic Programming

• Rotation

• Backtracking

What is the time complexity of finding the minimum value in a BST?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following operations is not supported efficiently by a BST?

• Search

• Insertion

• Deletion

• Random Access

How do you remove a node with two children in a BST?

• Replace it with its inorder predecessor.

• Replace it with its inorder successor.

• Replace it with the root node.

• Replace it with any leaf node.

Which property is maintained after every insertion in a Red-Black Tree?

• Every node is either red or black.

• The root is always black.

• All leaves (NIL nodes) are black.

• All of the above.

In a BST, which traversal order results in nodes being visited in descending order?

• Inorder

• Preorder

• Postorder

• Reverse Inorder