Before revision:  First, since sub-trees in each decoding step are generated in parallel, the theoretical runtime is logarithmic rather than linear.
After revision:  First, since sub-trees of a certain height in parallel, leading to logarithmic runtime complexity rather than linear.