Editing Search tree (section)

===Ternary search tree===
{{Main|Ternary search tree}}
A ternary search tree is a type of [[Tree (data structure)|tree]] that can have 3 nodes: a low child, an equal child, and a high child. Each node stores a single character and the tree itself is ordered the same way a binary search tree is, with the exception of a possible third node.

Searching a ternary search tree involves passing in a [[string (computer science)|string]] to test whether any path contains it.

The time complexity for searching a balanced ternary search tree is O(log n).