Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees (Logical Methods in Computer Science, 2017)