Page history
Jump to navigation
Jump to search
6 May 2023
5 May 2023
no edit summary
−52
no edit summary
−7
Created page with "== Trie == thumb|right|350px|A simple trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn". A '''trie''' (pronounced "try"), also known as a '''prefix tree''' or '''digital tree''', is a tree-like data structure used to store an associative array where the keys are usually strings. Each node in the trie represents a single character in the key, and the root node represents an em..."
+3,361