MCQs

Disclaimer:

Educational Use Only:

The website links provided are to be used strictly for educational and knowledge-gaining purposes only.

No Misuse:

Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.

Respect for Websites and Businesses:

Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.

Acknowledge Value of Knowledge:

Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.

No Endorsement:

The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.

User Responsibility:

By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.

Overall MCQs for Reference

1. What is an AVL tree?
   a. A tree which is balanced and is a height balanced tree
   b. A tree which is unbalanced and is a height balanced tree
   c. A tree with three children
   d. A tree with at most 3 children
   Answer: asanfoundry​
2. Why do we need a binary tree which is height balanced?
   a. To avoid formation of skew trees
   b. To save memory
   c. To attain faster memory access
   d. To simplify storing
   Answer: asanfoundry​
3. What is the balance factor for any node in an AVL tree?
   a. 0, 1, or -1
   b. 0, 1, or 2
   c. 0, -1, or -2
   d. 1, 2, or 3
   Answer: atestbook​
4. Which rotation is used to balance a left-left case in an AVL tree?
   a. Right rotation
   b. Left rotation
   c. Left-right rotation
   d. Right-left rotation
   Answer: ainterviewkickstart​
5. Which property does an AVL tree have?
   a. It is not a binary search tree
   b. It is always balanced with balance factor of only 0
   c. Maximum difference of heights of left and right sub-trees is 1
   d. It is only used for searching
   Answer: cinterviewkickstart+1​
6. What is the time complexity of searching in an AVL tree?
   a. O(1)
   b. O(log n)
   c. O(n)
   d. O(n^2)
   Answer: bw3schools+1​
7. What is the minimum height of an AVL tree with n nodes?
   a. log(n)
   b. log2 (n+1)
   c. n
   d. n^2
   Answer: btestbook​
8. How are AVL trees different from ordinary binary search trees?
   a. AVL trees are not binary search trees
   b. AVL trees are self-balancing
   c. AVL trees have more than two children
   d. AVL trees cannot be used for searching
   Answer: bw3schools+1​
9. An AVL tree requires balancing when the balance factor becomes?
   a. 0
   b. 1
   c. -1
   d. greater than 1 or less than -1
   Answer: dinterviewkickstart​
10. Which case requires a double rotation (left-right) in AVL trees?
    a. Right-right
    b. Left-left
    c. Left-right
    d. Right-left
    Answer: ctestbook+1​
11. An AVL tree with only one node has a balance factor of?
    a. 0
    b. 1
    c. -1
    d. Cannot be defined
    Answer: atestbook​
12. What operation is costly in AVL compared to searching?
    a. Insertion
    b. Search
    c. Sorting
    d. Traversal
    Answer: ainterviewkickstart​
13. Which type of tree is an AVL tree?
    a. Complete binary tree
    b. Balanced binary search tree
    c. B-tree
    d. Heap
    Answer: bsanfoundry+1​
14. What is the result of inserting nodes in sorted order into an AVL tree?
    a. Generates a skew tree
    b. Requires rotations to maintain balance
    c. No balancing needed
    d. Height becomes zero
    Answer: bw3schools+1​
15. Which data structure can efficiently implement associative arrays?
    a. B-tree
    b. Self-balancing binary search tree
    c. Stack
    d. Queue
    Answer: bsanfoundry​
16. Which balancing operation may be needed after insertion or deletion in an AVL tree?
    a. Right rotation
    b. Left rotation
    c. Restructuring
    d. All of the above
    Answer: deasyexamnotes​
17. What is the worst-case time complexity for insertion in an AVL tree?
    a. O(1)
    b. O(n)
    c. O(log n)
    d. O(n^2)
    Answer: ctestbook+1​
18. Which rotation is performed on a right-left imbalance in an AVL tree?
    a. Left rotation
    b. Right rotation
    c. Left-right rotation
    d. Right-left rotation
    Answer: dtestbook+1​
19. In which scenario is AVL tree not preferred?
    a. Many search operations, rare insertions
    b. Many insertions, few search operations
    c. Both search and insertions are frequent
    d. Only deletion operations
    Answer: binterviewkickstart​
20. AVL trees are named after?
    a. Adelson-Velsky and Landis
    b. Arthur, Victor, Louis
    c. Alan, Vincent, Larry
    d. Anderson, Velsky, Levis
    Answer: aw3schools​
21. Which of the following is not a rotation type for AVL trees?
    a. Left-left
    b. Right-right
    c. Left-center
    d. Left-right
    Answer: ctestbook+1​
22. Balance factor can be calculated as:
    a. Height(left) – Height(right)
    b. Height(left) + Height(right)
    c. Height(right) – Height(left)
    d. Height(left) / Height(right)
    Answer: aw3schools+1​
23. An AVL tree is always a:
    a. Full binary tree
    b. Binary search tree
    c. Heap
    d. Linked list
    Answer: btestbook​
24. Rotations in AVL trees are used to:
    a. Increase tree height
    b. Restore balance property
    c. Increase node values
    d. Traverse the tree faster
    Answer: binterviewkickstart​
25. After a node insertion, which nodes may require rebalancing in AVL?
    a. Newly inserted node only
    b. All ancestor nodes up to root
    c. Only root node
    d. Only leaf nodes
    Answer: binterviewkickstart​
26. Maximum height of an AVL tree with 7 nodes is:
    a. 2
    b. 3
    c. 4
    d. 5
    Answer: btestbook​
27. What is the minimum number of nodes in an AVL tree of height h?
    a. 2^h – 1
    b. h
    c. N(h-1) + N(h-2) + 1
    d. 2h – 1
    Answer: ctestbook​
28. The balance factor range for AVL nodes is:
    a. 0 or 1
    b. -1 to 1
    c. -2 to 2
    d. 0 to 2
    Answer: bw3schools+1​
29. When an insertion in AVL causes right-right case, what is performed?
    a. Left rotation
    b. Right rotation
    c. Double rotation
    d. No balancing required
    Answer: atestbook+1​
30. In AVL, which operation may lead to tree height reduction?
    a. Insertion
    b. Deletion
    c. Rotation
    d. Traversal
    Answer: binterviewkickstart​
31. Best use-case for AVL trees:
    a. Large number of insertions
    b. Large number of searches with occasional updates
    c. Constant traversal
    d. Small datasets only
    Answer: binterviewkickstart​
32. Which trees are not self-balancing?
    a. Red-black tree
    b. AVL tree
    c. Binary search tree (without balancing)
    d. Splay tree
    Answer: csanfoundry​
33. What happens if AVL tree is used for rapidly growing data with mostly insertions?
    a. Remains efficient
    b. Rotational overhead increases
    c. Balance factor always zero
    d. No rotations required
    Answer: binterviewkickstart​
34. Which traversal is used to print AVL tree elements in sorted order?
    a. Preorder
    b. Postorder
    c. Inorder
    d. Level order
    Answer: cw3schools​
35. Complexity for single rotation in AVL is:
    a. O(1)
    b. O(log n)
    c. O(n)
    d. O(n^2)
    Answer: ainterviewkickstart​
36. When is a ‘right-left’ rotation performed?
    a. Right child’s left subtree causes imbalance
    b. Left child’s right subtree causes imbalance
    c. No such rotation exists
    d. Only on deletion
    Answer: atestbook+1​
37. What does AVL stand for?
    a. Adelson-Velsky and Landis
    b. Advanced Value Lookup
    c. Automatic Variable Length
    d. Array Value List
    Answer: aw3schools​
38. When inserting into an AVL tree, how many rotations are needed to rebalance?
    a. At most 1
    b. At most log n
    c. At most 2
    d. At most n
    Answer: cinterviewkickstart​
39. Which structure guarantees logarithmic time for all operations?
    a. AVL tree
    b. Linked list
    c. Stack
    d. Hash table
    Answer: aeasyexamnotes​
40. AVL Tree falls under which type of tree?
    a. N-ary tree
    b. Heap
    c. Self-balancing binary search tree
    d. Threaded binary tree
    Answer: cinterviewkickstart​
41. What is the key advantage of AVL trees over plain binary search trees?
    a. Smaller memory usage
    b. Height balanced guaranteeing logarithmic time operations
    c. No rotations required
    d. Easy to code
    Answer: bw3schools+1​
42. The minimum number of nodes in AVL tree of height 3 is:
    a. 7
    b. 8
    c. 9
    d. 10
    Answer: atestbook​
43. In an AVL tree, a node’s balance factor of -2 after insertion indicates:
    a. Left subtree is too tall
    b. Right subtree is too tall
    c. Tree is balanced
    d. Tree is full
    Answer: binterviewkickstart​
44. How to calculate max number of nodes in AVL tree of height h?
    a. 
    b. 
    c. 
    d. 
    Answer: atestbook​
45. Does AVL allow duplicate elements?
    a. Yes, always
    b. No, never
    c. Only as left child
    d. Only as right child
    Answer: bw3schools​
46. Maximum possible balance factor for any AVL node?
    a. -2
    b. 2
    c. 1
    d. 3
    Answer: ctestbook+1​
47. Which of the following is false regarding AVL trees?
    a. They are self-balancing
    b. All leaf nodes are at same depth
    c. Searching is O(log n)
    d. Height difference is maintained
    Answer: bgeeksforgeeks+1​
48. What happens when AVL tree node’s balance factor is outside [-1, 1]?
    a. Tree remains unchanged
    b. Tree automatically rebalances itself using rotations
    c. Tree becomes a heap
    d. Tree discards nodes
    Answer: binterviewkickstart​
49. For n nodes, what is AVL’s minimum height?
    a. 
    b. 
    c. 
    d. 
    Answer: btestbook​
50. Primary characteristic of AVL tree useful for machine learning?
    a. Keeps data sorted and balanced for quick lookups, insertions, and deletions
    b. Stores unsorted data
    c. Uses array for storage
    d. No balancing required
    Answer: aw3schools+1​

1. https://www.sanfoundry.com/data-structure-questions-answers-avl-tree/
2. https://testbook.com/objective-questions/mcq-on-avl-tree–5eea6a1139140f30f369eb9d
3. https://interviewkickstart.com/blogs/learn/data-structures-and-algorithms-avl-trees
4. https://www.w3schools.com/dsa/dsa_data_avltrees.php
5. https://testbook.com/objective-questions/mcq-on-types-of-rotation-in-avl-tree–5eea6a1139140f30f369eb9f
6. https://www.sanfoundry.com/self-balancing-binary-search-tree-multiple-choice-questions-answers-mcqs/
7. https://easyexamnotes.com/tree-mcq/?generate_pdf=37323
8. https://www.geeksforgeeks.org/dsa/practice-questions-height-balancedavl-tree/
9. https://www.geeksforgeeks.org/quizzes/top-mcqs-on-balanced-binary-search-trees-with-answers/
10. https://www.examveda.com/data-structure/practice-mcq-question-on-advanced-trees-(avl,-redblack,-btrees)/?page=2
11. https://aimcqs.com/data-structures
12. https://t4tutorials.com/avl-trees-mcqs/
13. https://www.scribd.com/document/569700609/ds
14. https://www.scribd.com/document/626193506/mcq-on-tree-data-structures
15. https://siteforinfotech.com/2017/02/top-20-mcq-questions-trees-application.html
16. https://www.studocu.vn/vn/document/truong-dai-hoc-fpt/computer-science-introduction/avl-tree-questions-and-answers-sanfoundry/40650480