Description
Return zero for a root or parentDepth+1 otherwise.
A rooted tree organizes vertices by parent, children, and distance from a root. Root status changes local degree relationships, and height or leaf formulas assume the supplied structure really satisfies the tree model.
Return zero for a root or parentDepth+1 otherwise.
When to use this tool
Use Tree Root Depth Parent Step when you need a local rooted-tree count or bound from supplied structural facts.
How to use the tool and how it works
- Enter parentDepth, root. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read depth. Use the output convention below.
Require nonnegative integer parentDepth. Return zero for a root or parentDepth+1 otherwise.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| parentDepth | Parent Depth | Required. Safe integer; minimum 0. |
| root | Root | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| depth | Depth on the common length basis and sign convention above. | Required. Safe integer. |
{
"input": {
"parentDepth": 3,
"root": false
},
"output": {
"depth": 4
}
}Limitations and assumptions
- ParentDepth is validated even for a root; the tool does not inspect ancestry, detect cycles, or establish that the parent relation defines a tree.
- Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
- Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Numeric signed-zero results are exported as zero.
Alternative or Complementary methods
Traverse a verified tree to derive parent, depth, and leaf data directly. A formula using claimed degrees or depths cannot independently establish connectedness, acyclicity, or a valid root.
References
Similar or alternative tools
- Rooted Tree Preorder Parent Interval Check
Return nested for non-strict containment and proper only when nested and parentStart is strictly earlier.
- Tree Parent Edge Deficit
Return vertices-rootCount as expectedParentEdges and subtract parentEdges for deficit.