Introduction

In this chapter, you will look at certain data structures and algorithms that are not available for you in the FCL through Version 2.0. Examples are provided for algorithms like hash-code creation and string balancing. The FCL does not support every data structure you might need, so this chapter provides solutions for priority and double queues, binary and n-ary trees, sets, and a multimap, as well as many other things.