21. Template Method
nDefine
the skeleton of an algorithm and let subclasses complete
it
nFor example, a generic binary tree class or sort algorithm cannot be fully
implemented until a comparison operator is defined
nHow do we implement everything except the missing part?