  In this paper, we establish the matroid structures corresponding to
data-local and local maximally recoverable codes (MRC). The matroid structures
of these codes can be used to determine the associated Tutte polynomial. Greene
proved that the weight enumerators of any code can be determined from its
associated Tutte polynomial. We will use this result to derive explicit
expressions for the weight enumerators of data-local and local MRC. Also, Britz
proved that the higher support weights of any code can be determined from its
associated Tutte polynomial. We will use this result to derive expressions for
the higher support weights of data-local and local MRC with two local codes.
