Gary

Ternary Search Trees結合了binary search trees 及 digital search tries的優點，也就是說具備 digital search tries 只儲存word list節省空間與binary search tree搜尋快速的特性。適合拿來當作查詢字典的資料結構。實作在此架構的演算法除了exactly match之外，還有Partial-Match Searching & Near-Neighbor Searching。

參考資料：

• Ternary Search Trees – Dr. Dobb’s Journal April 1998
• Ternary Search Trees -Jon Bentley
• Java : Plant your data in a ternary search tree
• Sourceforge -C++ Code Ternary Search Trees