The document provides instructions to implement a binary search tree (BST) class with String and int data fields to store names and rankings. It then directs the creation of two BST objects: boysNameTree and girlsNameTree, which should each be populated with top 10 baby names from a given list. The trees are then to be searched for each name on the list and any names not on the list, printing the found names and rankings or indicating not found.