Partial alphabetic trees

In the partial alphabetic tree problem we are given a multiset of non-negative weights W={w1,…,wn}, partitioned into m⩽n blocks B1,…,Bm. We want to find a binary tree T where the elements of W reside in its leaves such that if we traverse the leaves from left to right then all leaves of Bi precede all leaves of Bj for every i