Segment Tree (Range Maximum Query with Node Update)
Segment Tree (Range Maximum Query with Node Update) 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 Segment Tree (Range Maximum Query with Node Update).
From the example next to this theory — Segment Tree (Range Maximum Query with Node Update): dry-run [4, 1, 3].
Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.
Viva — what is Segment Tree (Range Maximum Query with Node Update)? Then show left < root < right. Then name the trap.
What is Segment Tree (Range Maximum Query with Node Update)? Show this: left < root < right. Trap: unbalanced BST becoming a list.