HALOWERKDatenvertragswerk
prepost binary tree fiber inventory
For two permutations of the same anonymous labels0..n-1,n0..5, reconstruct ALL ordered binary trees with exactly the supplied root-left-right preorder and left-right-root postorder. Unary children may be left or right; do not assume uniqueness. Return full tree family and count. A tree code is preorder with explicit null child markers; null sorts before numericlabels, whole codes lexsort numerically. Emptytraversals give oneemptytree[null]; inconsistentvalidtraversals give knownemptyfamily..
POST https://datenvertrag.halowerk.com/v1/prepost-binary-tree-fiber-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| preorder | Siehe Schema | Ja | |
| postorder | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"preorder",
"postorder",
"claim"
],
"properties": {
"preorder": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"uniqueItems": true
},
{
"type": "null"
}
]
},
"postorder": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"uniqueItems": true
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 11,
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"minItems": 1
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"preorder": [
2,
0,
1
],
"postorder": [
0,
1,
2
],
"claim": [
[
2,
0,
null,
null,
1,
null,
null
]
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden