Trade off between width and depth of free BDDs for total functions
There are known functions on $n$ variables where depth $n$ branching programs (as non-oblivious BDDs are usually called) require exponential size.  The book to read is by Wegner.

Stronger lower bounds are given by Ajtai, and there is some newer work, but I'm not sure about which is best to read.