{"push_id":966477738,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"618e2c52c730914d9ab7fd55c2fd6ab03aad3f24","before":"fe94f602afd727b9d354e5fe76ddc4881dd390ba","commits":[{"sha":"618e2c52c730914d9ab7fd55c2fd6ab03aad3f24","author":{"email":"95f9d791c374ddef76370ea6c2a57b40db8ef604@gmail.com","name":"coredux"},"message":"104. Maximum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/coredux/Leetans/commits/618e2c52c730914d9ab7fd55c2fd6ab03aad3f24"}]}