Tag: Strings

Tree Data Structures

Compressed Trie Tree

Posted on

Hello, people! In this post, we will discuss a commonly used data structure to store strings, the Compress Trie Tree, also known as Radix Tree or Patricia (Practical Algorithm to Retrieve Information Coded in Alphanumeric) Tree. If you remember, the problem with a Trie Tree is that it consumes a lot of memory. So, due to […]

Tree Data Structures

Trie Tree Implementation

Posted on

Note – Theory of Programming is shifting to YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=EbamlevPlxY Hoping you’ll support the YouTube channel just like you have greatly supported the website! 🙂 Hello people…! In this post we will talk about the Trie Tree Implementation. Trie Trees are are used to search for all […]