{"push_id":4061451610,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9e6c2dfd2535bb53977fdf5d68d77f082ce72cda","before":"5e94d8261d0ba641b18939d3a49e3f7e7b0feac5","commits":[{"sha":"9e6c2dfd2535bb53977fdf5d68d77f082ce72cda","author":{"name":"Ved","email":"b1e9c58f6d1e2da284c4aded834f74fff8bf8c91@users.noreply.github.com"},"message":"O(n^2) approach for finding diameter of a tree","distinct":true,"url":"https://api.github.com/repos/ved-sinha/Trees/commits/9e6c2dfd2535bb53977fdf5d68d77f082ce72cda"}]}
{"actor":{"display_login":"ved-sinha"}}