(B) B (B(E)) B E (B(E(W))) B E W (B(E((I)W))) B E W I (B(E((I(L))W))) B E W I L (B((D)E((I(L))W))) B E D W I L (B((D)E((I(L))W))) B E D W I L (B((D)E((I(L(R)))W))) B E D W I L R (B((D)E((I(L((M)R)))W))) B E D W I L R M (B((D)E((I(L((M)R)))W))) B E D W I L R M (B((D)E((I(L((M(N))R)))W))) B E D W I L R M N (B((D)E((I(L((M(N))R(T))))W))) B E D W I L R M T N Tree depth is 8 levels. Warning: to prettyprint this, I'd need 256 columns.