{"push_id":1434860915,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8cfbedaa10760f70b8b4258a29872168edfbec08","before":"6fad25918872bc061ebf5bb65272b5e45b01a0c0","commits":[{"sha":"8cfbedaa10760f70b8b4258a29872168edfbec08","author":{"name":"NightSnack","email":"dcbf7b36a8992b01bbf8f1fb71b0d339a2698c9a@icloud.com"},"message":"队列和二叉树其中二叉树加入层次遍历的递归算法","distinct":true,"url":"https://api.github.com/repos/nightsnack/DataStructure/commits/8cfbedaa10760f70b8b4258a29872168edfbec08"}]}
{"actor":{"display_login":"nightsnack"}}