{"push_id":1279306088,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dd7c324c0b73715b5695bf70395fe70fac954712","before":"d0a7f216bdca0c918b533d4a9b7b54eaf0e35396","commits":[{"sha":"dd7c324c0b73715b5695bf70395fe70fac954712","author":{"name":"dlsyj","email":"771a6d458732885dc80b0a647e52c81716c0f3b6@users.noreply.github.com"},"message":"[116. Populating Next Right Pointers in Each Node][Accepted] First Round: (1) Loop through level 0 to level n - 2; (2) Traverse this level and connect children.","distinct":true,"url":"https://api.github.com/repos/dlsyj/InterviewPractice/commits/dd7c324c0b73715b5695bf70395fe70fac954712"}]}
{"actor":{"display_login":"dlsyj"}}