← Back to Data Structures & Algorithms
Balanced trees & heaps quiz
Five questions on Balanced trees & heaps. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
The AVL tree was published in:
Question 2 of 5
In an AVL tree, every node's balance factor must be:
Question 3 of 5
An AVL tree with n nodes has height at most about:
Question 4 of 5
A rotation in a BST:
Question 5 of 5
A right-right imbalance in an AVL tree is fixed by: