| Display title | Ternary search tree |
| Default sort key | Ternary search tree |
| Page length (in bytes) | 13,555 |
| Namespace ID | 0 |
| Page ID | 228754 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Carolyn |
| Date of page creation | 20:44, 9 May 2022 |
| Latest editor | imported>Carolyn |
| Date of latest edit | 20:44, 9 May 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an... |
