Perfect Binary Trees

Perfect Binary Trees is a DSA idea you prove with folder on disk, not with a slogan.

Perfect Binary Trees on the board — left < root < right. Then say what folder on disk looks like after.

Perfect Binary Trees exists so Riya can keep folder on disk correct in a file explorer.

Use Perfect Binary Trees when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Perfect Binary Trees trap — unbalanced BST becoming a list. Riya loses marks for that every viva.

Perfect Binary Trees is not a lonely heading. Riya ties it to folder on disk.

Close Perfect Binary Trees with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”