Tidy tree generator
Skip to the chartTidy tree
Explain parent-child structure with a clean node-link layout and readable labels. Create a private, publication-ready tidy tree directly in your browser without transmitting sensitive rows off-device. Data is processed locally on your hardware with zero server uploads, enabling instant export to SVG, PNG, and Excel data.
Edit the data, then export.
Everything runs in your browser. Your data is not uploaded.
Data
Paste tab-separated data from Excel or edit the cells directly.
Paste or import table data
Paste a header row, or choose a local CSV/TSV file. Files are read in this browser and capped at 500 rows.
Appearance
Preview
Sample preview of the example data. The live chart takes over as soon as you start working.
SVG, PNG, and Excel exports are generated locally in this browser. PowerPoint export is temporarily unavailable while its dependency path is reviewed for a high-severity image parser advisory.
Hierarchical Structure & Parent-Child Nesting
A tidy tree (or Reingold-Tilford tree) maps out parent-child relationships as a node-link diagram. Unlike standard hierarchical graphs that can become tangled, the tidy tree algorithm places nodes at the same depth on identical horizontal or vertical axes and prevents link crossing. This geometric arrangement ensures that repeating sub-structures maintain consistent visual shapes regardless of where they appear in the hierarchy. All layout calculations happen entirely within your local browser, meaning your organizational or sensitive relationship data is never uploaded to external servers.
Tree Data Representation & Branching
Format input columns for tidy tree with explicit headers and numerical measurements. Verify that rows represent discrete nodes or geographic units without unformatted symbol artifacts.
Sample Node Hierarchy
| Node ID | Parent ID | Department |
Navigation & Nested Density Best Practices
- Ensure sufficient visual distinction for tidy tree marks across standard and high-contrast viewports.
- Align text labels horizontally whenever possible to improve cognitive readability for tidy tree elements.
- Double-check scale boundaries and zero-anchors before exporting tidy tree presentation artwork.
- Data shape
- Node id, parent id, and optional numeric value columns
- Exports
- SVG, PNG, and Excel data; PowerPoint export is temporarily unavailable pending dependency review.
How it works
You edit a table in this page. The renderer draws an SVG from those rows in your browser, then you can download SVG, PNG, or Excel data. The table is not uploaded to any external processing server.
Frequently asked questions
What is the Reingold-Tilford tidy tree algorithm?
It is an efficient geometric algorithm that guarantees minimal tree width and ensures identical subtrees have identical visual shapes regardless of position.
Related tools
Reviewed 16 August 2026.