Merge two binary Max Heaps

Merge two binary Max Heaps 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 Merge two binary Max Heaps.

From the example next to this theory — Merge two binary Max Heaps: dry-run [4, 1, 3].

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

Viva — what is Merge two binary Max Heaps? Then show left < root < right. Then name the trap.