A PDF name tree consists of three kinds of nodes:
The root node contains only a kids entry, pointing to many
other objects
An intermediate node contains the limits of all the children in
its subtree, and a kids entry for each child
A leaf node contains a set of name-to-object mappings in a dictionary,
as well as the limits of the data contained in that child.