Three illustrations of the critical effect on program behavior of data structure selection are presented
Huffman coding, a text compression and coding technique, is used to show
good algorithm development
the benefits of good data structure selection
Optimal binary search trees, a related topic, are useful for storing static collections of information to be randomly accessed and traversed in sorted order; they demonstrate
the use of recursion
how to develop efficient programs based on recursion
Nearly optimal binary search trees are considered to emphasize program development
12.1: Techniques for Compressing Text or Storing Records
12.4: Optimal Binary Search Trees
12.5: Nearly Optimal Binary Search Trees