{"push_id":1488250223,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"70bbb3a2a92d301a7f5dc09244c8887965ea1da4","before":"87f08e79f515ba0d1da83d0fb198eb6b1931afa9","commits":[{"sha":"70bbb3a2a92d301a7f5dc09244c8887965ea1da4","author":{"name":"Arun Vasudevan","email":"e875e4c409a3928124dfc2e207166a23e6974ce2@gmail.com"},"message":"CtCI Chapter 4 Problem 3\n\nGiven a Binary Tree return a linked list for each depth.","distinct":true,"url":"https://api.github.com/repos/arunvasudevan/AlgoImplementations/commits/70bbb3a2a92d301a7f5dc09244c8887965ea1da4"}]}
{"actor":{"display_login":"arunvasudevan"}}