I think that your proposed encoding is basically based on LOUDS (level order unary degree sequence) built on full binary trees, leveraging the fact that the leaves can be omitted since each internal node has always two children. I therefore wonder whether using compressed bit vectors like RRR built upon a LOUDS representation (omitting the leaves) would achieve even better compression ratios.