Description
Return degree for a root or degree minus one as children.
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 degree for a root or degree minus one as children.
When to use this tool
Use Tree Root Nonroot Child Degree Budget when you need a local rooted-tree count or bound from supplied structural facts.
How to use the tool and how it works
- Enter degree, root. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read children. Use the output convention below.
Require nonnegative integer degree and, for a nonroot, degree at least one. Return degree for a root or degree minus one as children.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| degree | Degree | Required. Safe integer; minimum 0. |
| root | Whether this vertex is the root; a nonroot must have degree at least one. | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| children | Children | Required. Safe integer. |
{
"input": {
"degree": 3,
"root": false
},
"output": {
"children": 2
}
}Limitations and assumptions
- Root designation and degree are supplied rather than derived from actual edges; this local count does not prove a tree, verify parent membership, or inspect child identities.
- 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
- Tree Root Depth Parent Step
Return zero for a root or parentDepth+1 otherwise.
- Tree Leaf Removal Degree Budget
Subtract one from both degree and vertex count and mark parentBecomesLeaf when the new degree is exactly one.