In this paper, we show that trees implemented as a collection of pointers suffer from a lack of parallelism opportunities. We propose an alternative implementation based on arrays. Both implementations appear to be equivalently efficient time-wise. However, this new layout exposes new parallelism opportunities which can be then exploited by an optimizing compiler.