1
CJam, 100 bytes
q~_,2b,)2\#:Q1@{_2$<Q(S*:T*TQ2/:Q@ts[N+_,S*0@{@1$' >{2$_Q3*&2/^_4$>"\/"=t}*@)}/(NtU*o]o1:U$>\2*\}h];
Input must be a list of characters, without any ascii control characters. Empty nodes are denoted by a space. It also must be a complete binary tree with exactly 2n-1 nodes.
Ex...