{"push_id":1175819000,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"05f2d0527a8444e68796f9ea36a3f5bd0cc7a81e","before":"84188570dd7ee9c18b7e5a20f4174c996364e11a","commits":[{"sha":"05f2d0527a8444e68796f9ea36a3f5bd0cc7a81e","author":{"name":"lxyu0405","email":"a55148143f9684beee0bb9ec9d2257f3cba73f5e@gmail.com"},"message":"Binary Tree Preorder Traversal\n\nUse Stack","distinct":true,"url":"https://api.github.com/repos/lxyu0405/leetcode-pratice/commits/05f2d0527a8444e68796f9ea36a3f5bd0cc7a81e"}]}
{"actor":{"display_login":"lxyu0405"}}