{"push_id":998807117,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"88e8a9132a6d14f0db18f917b7189c9db17eaeba","before":"3eda781266f378307fc531b213f83957b2bbcccc","commits":[{"sha":"88e8a9132a6d14f0db18f917b7189c9db17eaeba","author":{"email":"1798bbfaad99e7dc78b6419eeb6e71b23e68cf1e@gmail.com","name":"Nitin Kumar Maharana"},"message":"94. Binary Tree Inorder Traversal","distinct":true,"url":"https://api.github.com/repos/nitin-maharana/LeetCode/commits/88e8a9132a6d14f0db18f917b7189c9db17eaeba"}]}