Consider alternative unfoldTreeM_BF and unfoldForestM_BF implementations

These algorithms only need queues; the full power of `Seq` is overkill, and must necessarily slow things down. We could switch to something simpler, like Okasaki's bootstrapped queues. Alternatively, there might, perhaps, be some other algorithms that avoid the need for queues altogether.
