Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations