{"push_id":1127719725,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b37fc33416f08186ac6800b177c14135334ffdfd","before":"9daa49701f4ccdd238cf4f1de9027e508e532198","commits":[{"sha":"b37fc33416f08186ac6800b177c14135334ffdfd","author":{"email":"ba10011579dc3ae806203e17d0422cf5874125c9@gmail.com","name":"wwanglsu"},"message":"recursion.  树的最左侧和最右侧, 高度都相等，就证明是一颗满二叉树","distinct":true,"url":"https://api.github.com/repos/wwanglsu/leetcode/commits/b37fc33416f08186ac6800b177c14135334ffdfd"}]}
{"actor":{"display_login":"wwanglsu"}}