A ternary search tree is a type of prefix tree where nodes are arranged as a binary search tree. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search.
Read full article from Java Program to Implement Ternary Search Tree | Sanfoundry
No comments:
Post a Comment