Tree Tools
Browse all available tree tools.
Available tools
- 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.
- Parent Forest Child Index Explicit complete acyclic parent forests with exact unique string node IDs and null roots; index every node’s direct children in source order, retaining leaf nodes with empty lists.
- Parent Forest Common Ancestor Chain Explicit complete acyclic parent forests with exact unique string node IDs and null roots; intersect inclusive ancestor chains for an explicit node set in nearest-first order from its first node; empty query has empty common evidence.
- Parent Forest Cycle Witness Find explicit parent-pointer cycle witnesses in a unique-ID record bank; incomplete references terminate safely and are not invented cycles.
- Parent Forest Descendant Inventory Explicit complete acyclic parent forests with exact unique string node IDs and null roots; select strict descendants in source order, not traversal order, and exclude the queried node.
- Parent Forest Identity Audit Audit parent-record duplicate identities and missing references without pretending incomplete or ambiguous data is a forest.
- Parent Forest Leaf Inventory Explicit complete acyclic parent forests with exact unique string node IDs and null roots; select nodes with no direct children, including isolated component roots.
- Parent Forest Level Groups Explicit complete acyclic parent forests with exact unique string node IDs and null roots; group all components by integer depth in ascending depth order with stable IDs within a level.
- Parent Forest Lowest Common Ancestor Explicit complete acyclic parent forests with exact unique string node IDs and null roots; find the lowest common ancestor including self; different components return null, not a fabricated shared root.
- Parent Forest Node Depths Explicit complete acyclic parent forests with exact unique string node IDs and null roots; compute edge depth from each component root without equating different roots.
- Parent Forest Node Path Explicit complete acyclic parent forests with exact unique string node IDs and null roots; return the unique undirected node path through the lowest common ancestor; different components have null path.
- Parent Forest Postorder Index Explicit complete acyclic parent forests with exact unique string node IDs and null roots; produce stable postorder traversal, with roots and child order determined by input record order.
- Parent Forest Preorder Index Explicit complete acyclic parent forests with exact unique string node IDs and null roots; produce stable preorder traversal, with roots and child order determined by input record order.
- Parent Forest Pruned Node Map Explicit complete acyclic parent forests with exact unique string node IDs and null roots; prune selected nodes and their entire descendant subtrees, retaining untouched source order and explicit removed identities.
- Parent Forest Root Inventory Explicit complete acyclic parent forests with exact unique string node IDs and null roots; inventory declared roots in source order without inferring dangling references as roots.
- Parent Forest Selected Node Ancestor Collapse Explicit complete acyclic parent forests with exact unique string node IDs and null roots; retain only caller-selected nodes, connecting each to its nearest retained ancestor or null root; no invented IDs or edge paths.
- Parent Forest Sibling Inventory Explicit complete acyclic parent forests with exact unique string node IDs and null roots; select nodes sharing exactly the same parent excluding self; null-root nodes share the explicit virtual-root sibling group.
- Parent Forest Subtree Height Explicit complete acyclic parent forests with exact unique string node IDs and null roots; compute longest descendant edge distance for every subtree; leaves have zero height.
- 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 Tree Reroot Transform Explicit complete acyclic parent forests with exact unique string node IDs and null roots; reroot only the queried tree by reversing its old ancestor chain, preserving every off-path edge and other component.