Its well established that for every matroid M and any weight function w, there exits a GREEDYBASIS(M,w) which returns a maximum weight basis of M. So, is vice-versa also true? That's if, there is some greedy algorithm then it must have matroid structure also. 
Does every greedy algorithm have matroid structure?
ds.algorithms;greedy algorithms