{"push_id":1291158360,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"5e984f786079682b5b570b7913ec3d137906df72","before":"d63a7c4537cf9e1a0f8f9883f7f3abe33909dea7","commits":[{"sha":"5e984f786079682b5b570b7913ec3d137906df72","author":{"name":"xsu11","email":"0e9bf54c4a759b98f36ce284f0e550ec8e0cef9f@hawk.iit.edu"},"message":"Solutions for Maximum Depth of Binary Tree.","distinct":true,"url":"https://api.github.com/repos/xsu11/leetcode/commits/5e984f786079682b5b570b7913ec3d137906df72"}]}
{"actor":{"display_login":"xsu11"}}