Java Program to Implement Ternary Search Tree

This is a Java Program to Implement Ternary Search Tree. 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.

Here is the source code of the Java Program to Implement Ternary Search Tree. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
/**
 ** Java Program to Implement Ternary Search Tree
 **/
  
import java.util.Scanner;
import java.util.ArrayList;
  
/** class TSTNode **/
class TSTNode
{
    char data;
    boolean isEnd;
    TSTNode left, middle, right;
  
    /** Constructor **/
    public TSTNode(char data)
    {
        this.data = data;
        this.isEnd = false;
        this.left = null;
        this.middle = null;
        this.right = null;
    }       
}
  
/** class TernarySearchTree **/
class TernarySearchTree
{
    private TSTNode root;
    private ArrayList<String> al;
  
    /** Constructor **/
    public TernarySearchTree()
    {
        root = null;
    }
    /** function to check if empty **/
    public boolean isEmpty()
    {
        return root == null;
    }
    /** function to clear **/
    public void makeEmpty()
    {
        root = null;
    }
    /** function to insert for a word **/
    public void insert(String word)
    {
        root = insert(root, word.toCharArray(), 0);
    }
    /** function to insert for a word **/
    public TSTNode insert(TSTNode r, char[] word, int ptr)
    {
        if (r == null)
            r = new TSTNode(word[ptr]);
  
        if (word[ptr] < r.data)
            r.left = insert(r.left, word, ptr);
        else if (word[ptr] > r.data)
            r.right = insert(r.right, word, ptr);
        else
        {
            if (ptr + 1 < word.length)
                r.middle = insert(r.middle, word, ptr + 1);
            else
                r.isEnd = true;
        }
        return r;
    }
  
    /** function to delete a word **/
    public void delete(String word)
    {
        delete(root, word.toCharArray(), 0);
    }
    /** function to delete a word **/
    private void delete(TSTNode r, char[] word, int ptr)
    {
        if (r == null)
            return;
  
        if (word[ptr] < r.data)
            delete(r.left, word, ptr);
        else if (word[ptr] > r.data)
            delete(r.right, word, ptr);
        else
        {
            /** to delete a word just make isEnd false **/
            if (r.isEnd && ptr == word.length - 1)
                r.isEnd = false;
  
            else if (ptr + 1 < word.length)
                delete(r.middle, word, ptr + 1);
        }       
    }
  
    /** function to search for a word **/
    public boolean search(String word)
    {
        return search(root, word.toCharArray(), 0);
    }
    /** function to search for a word **/
    private boolean search(TSTNode r, char[] word, int ptr)
    {
        if (r == null)
            return false;
  
        if (word[ptr] < r.data)
            return search(r.left, word, ptr);
        else if (word[ptr] > r.data)
            return search(r.right, word, ptr);
        else
        {
            if (r.isEnd && ptr == word.length - 1)
                return true;
            else if (ptr == word.length - 1)
                return false;
            else
                return search(r.middle, word, ptr + 1);
        }       
    }
    /** function to print tree **/
    public String toString()
    {
        al = new ArrayList<String>();
        traverse(root, "");
        return "\nTernary Search Tree : "+ al;
    }
    /** function to traverse tree **/
    private void traverse(TSTNode r, String str)
    {
        if (r != null)
        {
            traverse(r.left, str);
  
            str = str + r.data;
            if (r.isEnd)
                al.add(str);
  
            traverse(r.middle, str);
            str = str.substring(0, str.length() - 1);
  
            traverse(r.right, str);
        }
    }
}
  
/** class TernarySearchTree **/
public class TernarySearchTreeTest
{
    public static void main(String[] args)
    {
        Scanner scan = new Scanner(System.in);
  
        /* Creating object of TernarySearchTree */
        TernarySearchTree tst = new TernarySearchTree();
        System.out.println("Ternary Search Tree Test\n");
  
        char ch;
        /*  Perform tree operations  */
        do   
        {
            System.out.println("\nTernary Search Tree Operations\n");
            System.out.println("1. insert word");
            System.out.println("2. search word");
            System.out.println("3. delete word");
            System.out.println("4. check empty");
            System.out.println("5. make empty");
  
            int choice = scan.nextInt();           
            switch (choice)
            {
            case 1 :
                System.out.println("Enter word to insert");
                tst.insert( scan.next() );                    
                break;                         
            case 2 :
                System.out.println("Enter word to search");
                System.out.println("Search result : "+ tst.search( scan.next() ));
                break;
            case 3 :
                System.out.println("Enter word to delete");
                tst.delete( scan.next() );                    
                break;
            case 4 :
                System.out.println("Empty Status : "+ tst.isEmpty() );               
                break;   
            case 5 :
                System.out.println("Ternary Search Tree cleared");
                tst.makeEmpty();              
                break;                                       
            default :
                System.out.println("Wrong Entry \n ");
                break;  
            }
            System.out.println(tst);
  
            System.out.println("\nDo you want to continue (Type y or n) \n");
            ch = scan.next().charAt(0);                       
        } while (ch == 'Y'|| ch == 'y');       
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
Ternary Search Tree Test
  
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
4
Empty Status : true
  
Ternary Search Tree : []
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
apple
  
Ternary Search Tree : [apple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
pine
  
Ternary Search Tree : [apple, pine]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
pineapple
  
Ternary Search Tree : [apple, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
pin
  
Ternary Search Tree : [apple, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
in
  
Ternary Search Tree : [apple, in, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
i
  
Ternary Search Tree : [apple, i, in, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
mango
  
Ternary Search Tree : [apple, i, in, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
man
  
Ternary Search Tree : [apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
an
  
Ternary Search Tree : [an, apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
1
Enter word to insert
a
  
Ternary Search Tree : [a, an, apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
2
Enter word to search
pin
Search result : true
  
Ternary Search Tree : [a, an, apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
2
Enter word to search
pines
Search result : false
  
Ternary Search Tree : [a, an, apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
2
Enter word to search
pine
Search result : true
  
Ternary Search Tree : [a, an, apple, i, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
3
Enter word to delete
i
  
Ternary Search Tree : [a, an, apple, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
2
Enter word to search
i
Search result : false
  
Ternary Search Tree : [a, an, apple, in, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
3
Enter word to delete
in
  
Ternary Search Tree : [a, an, apple, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
3
Enter word to delete
apple
  
Ternary Search Tree : [a, an, man, mango, pin, pine, pineapple]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
3
Enter word to delete
pineapple
  
Ternary Search Tree : [a, an, man, mango, pin, pine]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
2
Enter word to search
apple
Search result : false
  
Ternary Search Tree : [a, an, man, mango, pin, pine]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
4
Empty Status : false
  
Ternary Search Tree : [a, an, man, mango, pin, pine]
  
Do you want to continue (Type y or n)
  
y
  
Ternary Search Tree Operations
  
1. insert word
2. search word
3. delete word
4. check empty
5. make empty
5
Ternary Search Tree cleared
  
Ternary Search Tree : []
  
Do you want to continue (Type y or n)
  
n