Trie Data Structure for Dictionary

• Fredkin (1960)

0 a 9 ad

1 b 10 da

2 c 11 aba

3 d 12 ar

4 r 13 ra

5 ab 14 abr

6 br

7 ac

8 ca

a

b

c

d

r

0 1 2 3 4

Depending on the size of the dictionary it might

be wise to have two array levels to minimize

searching.

Previous slide

Next slide

Back to first slide

View graphic version