{"push_id":695945980,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f448592d7f58a53434617bda8a2d99780f05a5c8","before":"e08fa59b1f51ffb72210a6ab99cf3413e874b1ac","commits":[{"sha":"f448592d7f58a53434617bda8a2d99780f05a5c8","author":{"email":"46f1a0bd5592a2f9244ca321b129902a06b53e03@yunzhu.org","name":"yunzhu-li"},"message":"Leetcode 226 / Lintcode 175: Invert binary tree.\n\nhttps://twitter.com/mxcl/status/608682016205344768\n\nMax Howell:\n“Google: 90% of our engineers use the software you wrote (Homebrew),\nbut you can’t invert a binary tree on a whiteboard so fuck off.”","distinct":true,"url":"https://api.github.com/repos/yunzhu-li/coding-practice/commits/f448592d7f58a53434617bda8a2d99780f05a5c8"}]}