docs(docs): add strategy, coding, and system design documentation hierarchy

docs/content/02-guides/01-coding/06-auxiliary-ordering/heap.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Heap'
+description: 'Partial order: cheap access to the extremum without a full sort.'
+sidebar:
+  order: 3
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::

docs/content/02-guides/01-coding/06-auxiliary-ordering/index.mdx

@@ -0,0 +1,18 @@
+---
+title: 'Auxiliary Ordering Structures'
+description: 'You do not traverse them; you maintain them while traversing something else.'
+sidebar:
+  order: 1
+  label: Introduction
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::
+
+## Patterns
+
+- [Stack](/guides/coding/auxiliary-ordering/stack) — LIFO memory of unresolved items; monotonic stack discards dominated candidates.
+- [Heap](/guides/coding/auxiliary-ordering/heap) — Partial order: cheap access to the extremum without a full sort.
+
+**Systems anchor:** Monotonic stack is log compaction; heap is priority scheduling, Dijkstra's frontier, timer wheels.

docs/content/02-guides/01-coding/06-auxiliary-ordering/meta.ts

@@ -0,0 +1,5 @@
+import { defineMeta } from "blume";
+
+export default defineMeta({
+  order: 6,
+});

docs/content/02-guides/01-coding/06-auxiliary-ordering/stack.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Stack'
+description: 'LIFO memory of unresolved items; monotonic stack discards dominated candidates.'
+sidebar:
+  order: 2
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::