原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
ie) stores the bit strings 1011, 10, 011, 100, and 0. When searching for a key a = a0a1 …
ap, go left at a node of depth i if ai = 0 and right if ai = 1.
Let S be a set of distinct bit strings whose lengths sum to n. Show how to use a radix tr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea