Description
Compute longest descendant edge distance for every subtree; leaves have zero height.
A parent-record forest represents each node by an exact string ID and a parent ID or null for a root. Depth counts edges toward a root; subtree height counts edges toward the deepest descendant. Node order, identity, cycles and missing references are separate properties that must be checked before structural transformations.
Compute longest descendant edge distance for every subtree; leaves have zero height.
When to use this tool
Use this tool to compute longest descendant edge distance for every subtree; leaves have zero height.
How to use the tool and how it works
- Enter parentsJson using the definitions below. Serialize JSON text fields in the decoded shape shown below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.heights, using the stated boundary, ordering, sign and absence conventions.
For each node find all proper descendants and take the maximum number of parent edges back to it, with zero as the leaf height.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| parentsJson | JSON array of {id,parent} records. id is an exact string; parent is another exact ID or null for a root. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
These decoded structures show the examples inside JSON text fields. Supply their serialized JSON strings as input.
{
"parentsJson": [
{
"id": "a",
"parent": null
},
{
"id": "b",
"parent": "a"
},
{
"id": "c",
"parent": "a"
},
{
"id": "d",
"parent": "b"
}
]
}| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.heights | Source-order {id,height} longest descendant edge distances; leaves have zero. |
{
"input": {
"parentsJson": "[{\"id\": \"a\", \"parent\": null}, {\"id\": \"b\", \"parent\": \"a\"}, {\"id\": \"c\", \"parent\": \"a\"}, {\"id\": \"d\", \"parent\": \"b\"}]"
},
"output": {
"result": {
"heights": [
{
"id": "a",
"height": 2
},
{
"id": "b",
"height": 1
},
{
"id": "c",
"height": 0
},
{
"id": "d",
"height": 0
}
]
}
}
}Limitations and assumptions
- The result uses edge-count height and source-order records, with no balancing or weighted path-length model.
- Structural operations require distinct node IDs, existing non-null parent IDs and no parent cycles; audit tools explicitly state when they accept incomplete structure. Multiple roots are allowed. Matching is exact and case-sensitive.
- Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
- Ordinary numeric outputs must be finite and within safe-integer magnitude. Exact large lengths/counts use decimal strings. Original record indexes and code-unit positions are zero-based; span ends are exclusive unless stated otherwise.
Alternative or Complementary methods
Use identity and cycle audits to inspect incomplete records, then structural operations on complete forests. Preserve sibling order explicitly when exchanging traversal results with another tree format.
References
Similar or alternative tools
- Parent Forest Subtree Sizes
Explicit complete acyclic parent forests with exact unique string node IDs and null roots; count each subtree including its root, preserving source node order.
- Parent Forest Ancestor Chain
Explicit complete acyclic parent forests with exact unique string node IDs and null roots; return strict ancestors nearest-first, excluding the query node; unknown IDs reject.