{"push_id":609868931,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4950f0081072b31a4d8d88608064f3244fef9a56","before":"7e916ca5e51040d3713b81b07b744627450d1839","commits":[{"sha":"4950f0081072b31a4d8d88608064f3244fef9a56","author":{"email":"8da347186ca3bf76f0095846e1d798b3515296d4@gmail.com","name":"vivian"},"message":"LeetCode - 110/Balanced Binary Tree/判断一棵树是否为平衡二叉树","distinct":true,"url":"https://api.github.com/repos/BigVivian/LeetCode/commits/4950f0081072b31a4d8d88608064f3244fef9a56"}]}