Q8_161_20250804144930.webp

☑Kizspy.me
Answer (Choose 1 answer)
☐ A
What distinguishes an AVL tree from other binary search trees?
A. It is always balanced.
B. It allows duplicate keys.
C. It does not support deletions.
D. It has a fixed height.
Back
Next
FUQ.sh
sh the exam.