For an AVL node, which balance-factor value indicates a perfectly balanced node?
Balance factor is height(left)-height(right); zero means equal heights.
What is the maximum possible height of an AVL tree with n nodes, asymptotically?
The AVL balance condition guarantees logarithmic height.
When deleting a leaf from a BST, what structural change is required?
A leaf has no children, so only its parent link needs adjustment.
In a BST, where is the maximum key located?
Repeatedly following right child links reaches the maximum.
In a BST, where is the minimum key located?
Repeatedly following left child links reaches the minimum.