{"push_id":1152567072,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8cd8bb684abb1f00f7131abd74da0f726648b048","before":"330e410d9a03fc4010659a120b8fc77f0b3061b6","commits":[{"sha":"8cd8bb684abb1f00f7131abd74da0f726648b048","author":{"name":"krunning2","email":"4ca25d9e849e78c025d6dbe275e45de6b169b93d@yahoo.com"},"message":"[270. Closest Binary Search Tree Value][Accepted]committed by Krunning","distinct":true,"url":"https://api.github.com/repos/krunning2/leetcode/commits/8cd8bb684abb1f00f7131abd74da0f726648b048"}]}
{"actor":{"display_login":"krunning2"}}