{"push_id":965114597,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4adc3fcf7bebc1155fc06bfbabbeb03f4771dbe9","before":"fb69dae76613c06d1429601f94819959745c70bf","commits":[{"sha":"4adc3fcf7bebc1155fc06bfbabbeb03f4771dbe9","author":{"email":"1ffa72f8cf58000240e1c9ba1182915559624d56@users.noreply.github.com","name":"murasak"},"message":"Create 104. Maximum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/murasak/Leetcode/commits/4adc3fcf7bebc1155fc06bfbabbeb03f4771dbe9"}]}