Skip to content
HALOWERK

Datenvertragswerk

tamari interval tree family

For two ordered full binary trees LOWER and UPPER with the same internal node count 0..4, coded as 0 for a leaf and (LR) for an internal node, reconstructs the entire directed Tamari order interval under the reassociation ((A B) C) -> (A (B C)) at any subtree. Returns every tree code in the interval in ascending ASCII order, the count and comparable. If LOWER cannot reach UPPER the result is an empty list, count 0 and comparable false. No mirror quotient.

POST https://datenvertrag.halowerk.com/v1/tamari-interval-tree-family

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
lowerSee schemaYes
upperSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "lower": {
      "anyOf": [
        {
          "type": "string",
          "minLength": 1,
          "maxLength": 17,
          "pattern": "^[0()]+$"
        },
        {
          "type": "null"
        }
      ]
    },
    "upper": {
      "anyOf": [
        {
          "type": "string",
          "minLength": 1,
          "maxLength": 17,
          "pattern": "^[0()]+$"
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "object",
          "properties": {
            "trees": {
              "type": "array",
              "items": {
                "type": "string",
                "minLength": 1,
                "maxLength": 17,
                "pattern": "^[0()]+$"
              },
              "minItems": 0,
              "maxItems": 14
            },
            "count": {
              "type": "integer",
              "minimum": 0,
              "maximum": 14
            },
            "comparable": {
              "type": "boolean"
            }
          },
          "required": [
            "trees",
            "count",
            "comparable"
          ],
          "additionalProperties": false
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "lower",
    "upper",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "lower": "0",
  "upper": "0",
  "claim": {
    "trees": [
      "0"
    ],
    "count": 1,
    "comparable": true
  }
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’