Boruvka's algorithm for Minimum Spanning Tree
Boruvka's algorithm for Minimum Spanning Tree 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 Boruvka's algorithm for Minimum Spanning Tree.
From the example next to this theory — Boruvka's algorithm for Minimum Spanning Tree: dry-run [4, 1, 3].
Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.
Viva — what is Boruvka's algorithm for Minimum Spanning Tree? Then show left < root < right. Then name the trap.
What is Boruvka's algorithm for Minimum Spanning Tree? Show this: left < root < right. Trap: unbalanced BST becoming a list.