Create pool of reusable PTree iterators

Each lookup into the PTree stores pointers to nodes in the tree in a `std::vector` for backtracking when iterating through the tree. The `std::vector`s could be re-used between lookups to save on the number of allocations done for each lookup.