{"push_id":1253232906,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d40f99c69ae07ff5218cfcde6ac0611e6cba8e3b","before":"44fec9013d75c728758b978ea791a61af79be81e","commits":[{"sha":"d40f99c69ae07ff5218cfcde6ac0611e6cba8e3b","author":{"name":"MingSeng-W","email":"fb10e138b04a84aaf5e61ceca5a5a8f6231dcd8c@qq.com"},"message":"二叉树的建立和先中后的递归遍历","distinct":true,"url":"https://api.github.com/repos/MingSeng-W/pat-practice/commits/d40f99c69ae07ff5218cfcde6ac0611e6cba8e3b"}]}
{"actor":{"display_login":"MingSeng-W"}}