Description
List all terminal literal word paths in source node order, including an explicitly terminal root as the empty word.
A trie stores literal words as root-to-node character paths, with terminal flags marking complete words. A terminal can also have children, and an existing prefix path need not be a stored word. This family uses one UTF-16 code unit per ordinary edge, so code-unit length differs from a displayed character or Unicode code-point count.
List all terminal literal word paths in source node order, including an explicitly terminal root as the empty word.
When to use this tool
Use this tool to list all terminal literal word paths in source node order, including an explicitly terminal root as the empty word.
How to use the tool and how it works
- Enter nodesJson using the definitions below. Serialize JSON text fields in the decoded shape shown below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.words, using the stated boundary, ordering, sign and absence conventions.
For each terminal node in node-table order walk parent links to the root, prepend edge characters, and return its node ID with the reconstructed word.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| nodesJson | JSON array of {id,parent,character,terminal} nodes under the complete root-zero trie rules below. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
These decoded structures show the examples inside JSON text fields. Supply their serialized JSON strings as input.
{
"nodesJson": [
{
"id": 0,
"parent": null,
"character": "",
"terminal": false
},
{
"id": 1,
"parent": 0,
"character": "a",
"terminal": true
},
{
"id": 2,
"parent": 1,
"character": "b",
"terminal": true
},
{
"id": 3,
"parent": 0,
"character": "b",
"terminal": true
}
]
}| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.words | Terminal-node {id,word} records in original node order. |
{
"input": {
"nodesJson": "[{\"id\": 0, \"parent\": null, \"character\": \"\", \"terminal\": false}, {\"id\": 1, \"parent\": 0, \"character\": \"a\", \"terminal\": true}, {\"id\": 2, \"parent\": 1, \"character\": \"b\", \"terminal\": true}, {\"id\": 3, \"parent\": 0, \"character\": \"b\", \"terminal\": true}]"
},
"output": {
"result": {
"words": [
{
"id": 1,
"word": "a"
},
{
"id": 2,
"word": "ab"
},
{
"id": 3,
"word": "b"
}
]
}
}
}Limitations and assumptions
- A terminal root represents the empty word. Output order follows the supplied table rather than lexical sorting.
- Ordinary node tables have at most 128 nodes with distinct IDs 0–127, one root ID 0 with empty character and null parent, unique parent/character edges, complete acyclic parent links and a boolean terminal flag. Every nonroot character is exactly one UTF-16 code unit.
- Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
- Ordinary numeric outputs must be finite and within safe-integer magnitude. Exact large lengths/counts use decimal strings. Original record indexes and code-unit positions are zero-based; span ends are exclusive unless stated otherwise.
Alternative or Complementary methods
Choose word membership, prefix existence, completion or ranking according to the question. Normalize text separately if needed; these operations preserve exact code units and caller order.
References
Similar or alternative tools
- Prefix Trie Terminal Membership Bit List
Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; test exact terminal word membership for each supplied query, preserving empty queries and repeated occurrences.
- Prefix Trie Terminal Word Weight Totals
Aggregate nonnegative supplied word occurrence weights before trie completion scoring; exact literal word identity, no inferred corpus frequency.