data structure quizizzzs

Who invented AVL Trees?

• Donald Knuth
  
  
  

• Adelson-Velsky and Landis

• Alan Turing

• Charles Babbage

What is the balance factor in an AVL tree?

• Difference in height of left and right subtrees

• Sum of all node values

• Number of children
  

• None of the above

What type of rotation is used for an LR imbalance?

• Right rotation
  
  

• Left rotation

• Right-Left rotation

• Left-Right rotation

What is the time complexity for searching in an AVL tree?

• O(n)
  

• O(log n)
• O(1)

• O(n log n)

Which is not true about AVL trees?

• They are always balanced
  

• Insertion may require rebalancing

• Deletion is not allowed

• Searching is efficient

What is the maximum height difference allowed in an AVL tree?

• 1
  

• 2

• 3

• 4

Which operation is performed to maintain the balance of an AVL tree?

• Searching

• Sorting

• Rebalancing

• Traversal
  

What is the primary advantage of using AVL trees over regular binary search trees?

• They require less memory
  

• They guarantee O(log n) height

• They allow duplicate values

• They are easier to implement

Which of the following operations can cause an AVL tree to become unbalanced?

• Only insertion
  

• Only deletion

• Both insertion and deletion

• Traversal

Which of the following is a characteristic of AVL trees?

• They are implemented using linked lists

• They do not allow duplicate keys

• They are a type of self-balancing binary search tree

• They can have a balance factor of 2