{"push_id":2530318330,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"c3c9f80c4e22c55b26c6dc3c9fd3f92222d1924b","before":"495c3ea63f764c161da565ea70845aea33a32f9e","commits":[{"sha":"b52e82dc67ec0b642fc8780957f10743cb009952","author":{"name":"Xiake Sun","email":"b4649ac0174a1f6fe0517873e1df94cbcad3f82b@gmail.com"},"message":"add Programming-Assignment-1 of week1","distinct":true,"url":"https://api.github.com/repos/sammysun0711/data_structures_fundamental/commits/b52e82dc67ec0b642fc8780957f10743cb009952"},{"sha":"c3c9f80c4e22c55b26c6dc3c9fd3f92222d1924b","author":{"name":"Xiake Sun","email":"b4649ac0174a1f6fe0517873e1df94cbcad3f82b@gmail.com"},"message":"faster implemtation to calculate tree height by finding all depth of node to root, and save it as cache, at last we choose the max depth as tree height","distinct":true,"url":"https://api.github.com/repos/sammysun0711/data_structures_fundamental/commits/c3c9f80c4e22c55b26c6dc3c9fd3f92222d1924b"}]}
{"actor":{"display_login":"sammysun0711"}}