{"push_id":555909742,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f60d944b60c3e5c02b0ffc6c22ead563436697ed","before":"5beed1a61bf80572e16e4b34180309b29cd1e11a","commits":[{"sha":"f60d944b60c3e5c02b0ffc6c22ead563436697ed","author":{"email":"88cfb625f00d3319dff93c158c99a42f7c04bc12@gmail.com","name":"Sachin B. Chavan"},"message":"Create Balanced Binary Tree\n\nGiven a binary tree, determine if it is height-balanced.\r\n\r\nFor this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.","distinct":true,"url":"https://api.github.com/repos/sachin005/leetcode/commits/f60d944b60c3e5c02b0ffc6c22ead563436697ed"}]}