AVL Tree

AVL Tree (guide) is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know AVL Tree (guide).

From the example next to this theory — AVL Tree (guide) — Dry-run [4, 1, 3].

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is AVL Tree (guide)? Then show left < root < right. Then name the trap.