Ternary Search Trees Explained and Implemented in Java with Examples | TST | Geekific

In the last video of this series we discussed and implemented Tries. So, today we will tackle one of its special implementations: Ternary Search Trees. Tries and TSTs basically represent a time/space trade off... Let's dive deeper in the topic!

Timestamps:
00:00 Introduction
00:28 What is a Ternary Search Tree?
01:30 Inserting a word into the tree
02:15 Searching for a word in the tree
02:55 Deleting a word from the tree
03:40 Ternary Search Tree Implementation
08:55 Testing and Visualizing our Code
09:36 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #TernarySearchTree #TST #DataStructures