We construct efficient, unconditional non-malleable codes that are secure against tamper- ing functions computed by decision trees of depth n^{1/4–o(1)} . Prior to this work, no efficient unconditional non-malleable codes were known for decision trees beyond depth logn. Our result also yields efficient, unconditional non-malleable codes that are exp(–n^{Omega(1)})- secure against constant-depth circuits of exp(n^{Omega(1))-size. Prior work of Chattopadhyay and Li (STOC 2017) and Ball et al. (FOCS 2018) only provide protection against exp(O(log^2(n)))-size circuits with exp(–O(log^2(n)))-security. We achieve our result through simple reductions of decision tree tampering to split-state tampering. As an intermediary, we give a simple and generic reduction of leakage-resilient split-state tampering to split-state tampering. Prior work of Aggawarl et al. (TCC 2015) only provides a reduction to split-state non-malleable codes with decoders that exhibit particular properties.