Related Searches Tree
Use cases
Breadth-first search using queue-based approach via ValueSERP /search endpoint.
Tracks visited keywords to prevent circular traversal.
Detects previously rendered nodes and marks as "(circular)".
Crawl depth 1-3 levels, max results 5-20 per keyword.
9 location options.
Platform
Browser-based (no installation required)
Input
ValueSERP API key
Seed keywords (one per line)
Output
CSV: parent/child relationships. DOT: Graphviz format. Keywords list: all unique. ASCII tree: text hierarchy. Interactive table display.
Features
- Breadth-first queue-based exploration
- Circular reference detection
- Crawl depth slider (1-3, default 2)
- Max results per keyword (5-20, default 10)
- 9 location options (UK, US, AU, etc.)
- DOT Graphviz export format
How to use
- 1 Enter your ValueSERP API key
- 2 Input seed keywords (one per line)
- 3 Set crawl depth (1-3) and max results
- 4 Select location (9 options)
- 5 Check the estimated API calls shown before running
- 6 Build the tree; visited keywords are skipped to prevent loops
- 7 Download CSV, DOT, keywords list, or view the ASCII tree
Frequently asked questions
- How many API credits will a run use?
- Roughly one ValueSERP search per keyword explored, and this grows exponentially with depth. The tool estimates it as max_results to the power of each level, summed: with the defaults of depth 2 and 10 results that is up to 111 calls per seed keyword, and depth 3 with 10 results is up to 1,111. The real number is usually lower because already-visited keywords are skipped, but treat the on-screen estimate as your worst case before clicking Build Tree.
- Why does raising max results above 10 not find more keywords?
- The API request itself is fixed (num=10) and Google only returns however many related searches it has for a query, typically a handful. The max results slider just truncates that returned list client-side, so it is effective as a cost limiter at low values but cannot force Google to return more suggestions at high values.
- Why do keywords at the deepest level have no children?
- By design. A keyword found at the final depth level is recorded as a child in the tree but never queried itself, so the tree always ends one level after the last round of API calls. Depth 1 means only your seed keywords are queried.
- Is there any rate limiting between API calls?
- No, requests are fired back to back with no delay. That is normally fine because ValueSERP is a paid API designed for volume, but be aware of it if your plan has a concurrency or per-second limit.
- Why is everything lowercase in the export?
- Parent and child keywords are lowercased when relationships are recorded, and exact self-references (parent equals child) plus duplicate rows are removed after the crawl. The DOT and CSV exports therefore contain normalised lowercase keywords rather than what Google displayed.
Want me to run this for you?
I run this tool as a managed service, or build something custom around your data. You get the insights without touching the code.
Related Tools
Analyse URL overlap across multiple keyword SERPs to find cannibalisation.
Classify keywords into Google's 4 micro-moments using OpenAI.
Recursively extract PAA questions using ValueSERP API.
Classify keywords into hierarchical themes and subthemes using AI.
Compare keyword lists to find gap opportunities with content matching.
Generate JSON-LD structured data for common schema types.
Need something built for your business?
This tool started as bespoke client work. I build custom scripts, data pipelines, and full apps for SEO and product data problems that off-the-shelf tools don't solve.
Tell Me What You Need