DS Quiz2

What is the worst case time complexity of searching an item in AVL tree?

• O(1)

• O(Log N)

• O(N log N)

• N log (N)

What is the average case time complexity of inserting an item in an AVL tree?

• O(1)

• O(Log N)

• O(N)

• O(N log N)

Which of the following operations can be performed in O(Log N) time in an AVL tree?

• Insertion

• Deletion

• Searching

• All of the above

We have 2,5 in AVL tree. When we insert 7 in that AVL tree whether it maintains AVL property?

• no

• yes

What balancing technique is used in an AVL tree to maintain its height?

• Left Rotation

• Right Rotation

• All of the above

What is the maximum height of an AVL tree with N nodes?

• O(N)

• O(Log N)

• O(N log N)

• O(sqrt(N))

The AVL tree has 5,7. When we insert 6, which rotation is needed to balance the tree?

• SRR

• DRR

• SRL

• DRL

How does an AVL tree determine when to perform a rotation?

• By checking the balance factor

• By counting the number of nodes

• By comparing values

• By the height of the tree

What is the balance factor of a node in an AVL tree?

• Height of left subtree - height of right subtree

• Height of right subtree - height of left subtree

• Number of nodes in left subtree - number of nodes in right subtree

• Height of the node itself

In an AVL tree, what happens to the balance factor after a rotation?

• It becomes zero

• It can become -1, 0, or 1

• It is reset to the height of the tree

• It is not affected