{"push_id":1143487313,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6ad2b8ae3d5baa706421c4557c5e6db15e10998c","before":"c411b264a6585777fa4c4208436110e28d547247","commits":[{"sha":"6ad2b8ae3d5baa706421c4557c5e6db15e10998c","author":{"name":"Harsha Yadav Kommanaboyina","email":"07a4eef64f70b431e460dec7eda9c2b74d869c59@yahoo.com"},"message":"Create Maximum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/harsha-sjsu/LeetCode/commits/6ad2b8ae3d5baa706421c4557c5e6db15e10998c"}]}
{"actor":{"display_login":"harsha-sjsu"}}