Every extremal minimal bipartite matching covered graph is obtained from two copies of a halin tree by adding a matching between the corresponding leaves.
