Data Structures Quiz

Which of the following operations may cause a rotation in an AVL tree?

• Search

• Traversal

• Insertion

• Display

What is the worst-case time complexity of insertion in a Red-Black Tree with n elements?

• O(log n)

• O(n)

• O(1)

• O(n log n)

Which of the following statements is true about Splay Trees?

• They maintain perfect balance using rotations.

• Recently accessed elements are moved to the root.

• They require color properties like Red-Black Trees.

• They cannot be used as a binary search tree.

In a B-Tree of order m, what is the maximum number of children a node can have?

• m − 1

• m

• m + 1

• 2m

What is the height of an AVL Tree with n nodes in the worst case?

• O(log n)

• O(n)

• O(n log n)

• O(√n)