A ternary search tree is a data structure for efficiently storing string data using prefixes.
Questions tagged [ternary-search-tree]
35 questions
0
votes
1 answer
How to list in an alphabetical order the words of a ternary search tree?
How can I go about listing the words a TST contains in an alphabetical order?
Unlike BSTs where an in-order traversal will do the trick, this won't work TST. Neither would pre-order nor post-order traversals.
More so, the nodes of TST contain…
mkab
- 933
- 4
- 16
- 31
0
votes
0 answers
Serialize custom ternary search tree in java
I would like to convert a dictionary of words into a binary file.
after some search time, I found out that ternary search tree is the best option for my usage.
I couldn't find how to serialize it to a file.
Each node will have a char value, 3…
leah
- 433
- 5
- 7
0
votes
2 answers
Exploring a binary search tree
I figure a binary search tree is the simplest example, but really I would like to know how to explore a ternary search tree or some variety of tries. I don't have any experience with these, but I understand the concepts of adding to and searching…
tau
- 6,499
- 10
- 37
- 60
0
votes
1 answer
Searching for (NOT with) wildcards inside an ternary search tree
I want to modify an recursive function from an 'ternary search tree' library (sourceforge & http://code.google.com/p/ternary-search-tree/).
The default behaviour is to search in an ternary search tree for all occurences of strings that match an…
Constantin
- 8,721
- 13
- 75
- 126
-1
votes
1 answer
Search function for a tree
I am working with a ternary search tree. Following code should give you an overview of how the tree looks like. Every leaf will contain a pointer to a linked list which contains pointer to the head node. Every leaf can have at most 3 nodes.…
user1010101
- 2,062
- 7
- 47
- 76