原书出处
System Design Interview – An insiders guide, Second Edition
13 搜索自动补全
Trie (pronounced “try”) is a tree-like data structure that can compactly store strings. The name comes from the word retrieval, which indicates it is designed for string retrieval operations. The main idea of trie consists of the following: •A trie is a tree-like data structure. •The root represents an empty string. •Each node stores a character and has 26 children, one for each possible character.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0031_split_003.html
EPUB SHA-256:ffc3a97753094acb30719f26589af322724b6c17c10371f0626e61687734b345