Some concepts are structural, such as heaps, organisational charts, and information-system pyramids. A hierarchy graph question asks the taker to build that structure and is available on every plan.
What a hierarchy graph question is
The taker drags nodes into a pyramid, draws directed edges, and explains their reasoning. QuizMachine grades the result automatically.
Three ways to grade
Custom edges. Define the required parent-child links by node name. A correct submission contains every required edge; extra edges and unconstrained placements are allowed.
min-heap Give nodes numeric labels; any arrangement where every parent is less than or equal to its children is accepted.
max-heap Uses the inverse rule, where every parent is greater than or equal to its children, and accepts every valid arrangement.
Setting one up
- In the question editor, choose Hierarchy Graph Under Structure.
- Pick the number of layers. The editor shows exactly as many node inputs as there are slots.
- Enter one label per node. For a min- or max-heap question, use numbers.
- Choose a validation mode. For Custom edges, add each required edge by selecting its two nodes by name.
- The taker must explain the completed hierarchy before submitting it.
Works on phones too
Drag-and-drop works with mouse and touch. Takers can also tap a node and then a slot, and the interaction is keyboard accessible.
When to reach for it
- Data-structures courses — heaps, trees, priority queues.
- Information-systems and management modules — layered system hierarchies.
- Onboarding and org-design training — who reports to whom.
Tip: for custom edges, keep node labels short and unique because they are also used when defining correct edges.