An R-way Trie is a tree-like data structure, also known as a Prefix Tree or, more generically, a Digital Search Tree (DST)/Digital Tree. It is commonly used to implement string-based table symbol structures. It has a certain ressemblance to a binary tree, it contains Implementation
Implementation
The trie tree always starts with a root node ( blank circle ), it has no value and only satisfies the purpuse of a entry point. Other than the root, every single Node will have at least one parent pointing to self.
