Enumeration of Binary Trees
Enumeration of Binary Trees 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 Enumeration of Binary Trees.
From the example next to this theory — Enumeration of Binary Trees: dry-run [4, 1, 3].
Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.
Viva — what is Enumeration of Binary Trees? Then show left < root < right. Then name the trap.
Exam tip
What is Enumeration of Binary Trees? Show this: left < root < right. Trap: unbalanced BST becoming a list.