December 2007
Intermediate to advanced
896 pages
19h 57m
English
In this chapter, you will look at certain data structures and algorithms that are not available for you in the FCL through Version 3.5. Examples are provided for algorithms such as hash-code creation and string balancing. The FCL does not support every data structure you might need, so this chapter provides solutions for priority, binary and n-ary trees, and a multimap, as well as many other things.
Read now
Unlock full access