×
Home Discussions Write at Opengenus IQ
×
  • Home
  • Write at OpenGenus IQ
  • Discussions

ternary search tree

A collection of 1 post

data structure

Ternary Search Trees

Ternary Search Tree is a special type of trie data structure and is widely used as an low memory alternative to trie in a vast range of applications like spell check and near neighbor searching. The average case time complexity is O(log N) for look-up, insertion and deletion operation.

Aman Agarwal
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2019 All rights reserved ™
Top Posts Twitter