{"push_id":549435411,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6a446a94fb9bb20a7fc41a00166217cd180b2f7c","before":"aafc13b22cc66727167bb8d46faa7100a2cd5297","commits":[{"sha":"6a446a94fb9bb20a7fc41a00166217cd180b2f7c","author":{"email":"7ab20f99b22decd0d1d8dd5c5b78feb8a4bda2af@gmail.com","name":"wuxun"},"message":"Binary Tree Inorder Traversal","distinct":true,"url":"https://api.github.com/repos/wuxun/leetcode/commits/6a446a94fb9bb20a7fc41a00166217cd180b2f7c"}]}