{"push_id":2720182149,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"27228c074d7750e551e8fded5240d1d20410a298","before":"205a456da5d5450f8b7354b00b42c80cc3fd1ee1","commits":[{"sha":"27228c074d7750e551e8fded5240d1d20410a298","author":{"name":"Jianchao Li","email":"dc5dd61ac1a5aebc425d0037691bb0bf9490e1e7@gmail.com"},"message":"144. Binary Tree Preorder Traversal","distinct":true,"url":"https://api.github.com/repos/jianchao-li/leetcode/commits/27228c074d7750e551e8fded5240d1d20410a298"}]}
{"actor":{"display_login":"jianchao-li"}}