Balanced Trees: AVL and Red-Black Trees for Exam Prep

Balanced Trees: AVL and Red-Black Trees - Implementations in Python - Higher Difficulty Problems

Q. How many rotations are required in the worst case when inserting a node into an AVL tree?

Solution

In the worst case, inserting a node into an AVL tree may require up to 2 rotations to maintain balance.

Correct Answer: B — 2

Q. What is the main purpose of balancing in AVL and Red-Black trees?

Solution

The main purpose of balancing in these trees is to ensure that operations can be performed in O(log n) time.

Correct Answer: B — To ensure O(log n) time complexity for operations

Q. Which traversal method is commonly used to print the elements of a binary search tree in sorted order?

Solution

In-order traversal of a binary search tree visits nodes in sorted order.

Correct Answer: C — In-order

Showing 1 to 3 of 3 (1 Pages)