Similar to 探索木
二分探索木
Binary search treeB木
B-tree0
01
12
23
3▼-1 trends4
45
56
67
78
89
913
13 (number)19
19 (number)40
40 (number)50
50 (number)70
70 (number)探索
Search algorithmA*
A* search algorithmBinary Independence Model
Binary Independence ModelBitapアルゴリズム
Bitap algorithmK近傍法
K-nearest neighbors algorithmアルファ・ベータ法
Alpha–beta pruningISSEI (検索)
エイホ–コラシック法
Aho–Corasick algorithm局所性鋭敏型ハッシュ
Locality-sensitive hashing均一コスト探索
Uniform-cost searchクヌース–モリス–プラット法
Knuth–Morris–Pratt algorithm