Q: What is an AVL tree?

A A tree in which each node has at most one child
B A tree in which each node has exactly two children
C A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 1
D A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 2
Share this MCQ

Learn More MCQ Questions from Data Structure Tree

This set of multiple choice questions (MCQs) covers various concepts related to trees in data structure. Test your knowledge and improve your understanding of binary trees, binary search trees, AVL trees, red-black trees, and more.