{"push_id":2957802072,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ca4403f15cd901fbe3813a61db888271c59d2bd7","before":"89257d0f41869f6f12bf0855e2d1a8d149682572","commits":[{"sha":"ca4403f15cd901fbe3813a61db888271c59d2bd7","author":{"name":"SourDumplings","email":"6e052fbbe75e384f1f7a491443c7c67d1425ce4d@foxmail.com"},"message":"修改与补充：\n1.为二叉树的后序遍历增加了一种非递归算法\n2.将树结点深度计算移至为树的方法\n3.为树增加LCA算法","distinct":true,"url":"https://api.github.com/repos/SourDumplings/DSNA/commits/ca4403f15cd901fbe3813a61db888271c59d2bd7"}]}
{"actor":{"display_login":"SourDumplings"}}