Tries

From Wiki :-)
Revision as of 07:04, 3 June 2018 by Savoundg (talk | contribs) (Created page with "Tries is used to store words in a tree. From the root to the leaves, it forms a word. Each node should contain a flag that indicates if it is a complete word.")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Tries is used to store words in a tree. From the root to the leaves, it forms a word.

Each node should contain a flag that indicates if it is a complete word.