{"push_id":955048128,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1d1dbe8550dfe2912da36c5ec43614b26f491ec5","before":"aa4953757bef1710042a304347448cd45be930b7","commits":[{"sha":"1d1dbe8550dfe2912da36c5ec43614b26f491ec5","author":{"email":"24b4c510a3624287fb447bd60fa054fd5356d052@gmail.com","name":"jonnyjack"},"message":"Added a swap method on BinTree to make the logic for the default\ndelete method no the binary search tree without rebalancing\neasier to understand... only problem is that the swap function is\nridiculous.  I need to learn some more python idioms and\nhow to restructure these if blocks...","distinct":true,"url":"https://api.github.com/repos/frankbryce/PyDataStructures/commits/1d1dbe8550dfe2912da36c5ec43614b26f491ec5"}]}