{"push_id":3041142210,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d526b60d1b051658bf5bb2a4cbff6e485bf4e676","before":"2345ab858749e021bef8bbd93bd6659fc292a346","commits":[{"sha":"d526b60d1b051658bf5bb2a4cbff6e485bf4e676","author":{"name":"Einsler Lee","email":"ae1c9fc9a731331a98b9b04ffc16dd7109a9aa96@163.com"},"message":"Q102，二叉树的层次遍历，感觉这个题很好，可以配合着使用队列。其实这个qsize完全可以用队列的大小来替代。","distinct":true,"url":"https://api.github.com/repos/Geass-LL/LeetCode/commits/d526b60d1b051658bf5bb2a4cbff6e485bf4e676"}]}
{"actor":{"display_login":"Geass-LL"}}