Minimal weighted planar binary trees

The aim of the present work is to generalize the well known Melzak's algorithm and the notion of the twisting number to the case of weighted planar binary trees. That gives us the opportunity to obtain some essential restrictions to the possible topologies of minimal weighted planar binary trees.