{"push_id":2773916603,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7f998e15af91a65c755f63c4ff11bb0c82d88544","before":"ea553a74b11461644db0d0539f467aae1744e80a","commits":[{"sha":"7f998e15af91a65c755f63c4ff11bb0c82d88544","author":{"name":"Nazmul Idris","email":"bdaae1d4e042d40d28413fb2167b0433aaea3428@google.com"},"message":"Improve binary tree BFS implementation\n\n- Remove the map that holds already-visited-nodes since these are\n  not needed","distinct":true,"url":"https://api.github.com/repos/nazmulidris/algorithms-in-kotlin/commits/7f998e15af91a65c755f63c4ff11bb0c82d88544"}]}
{"actor":{"display_login":"nazmulidris"}}