{"push_id":984238887,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4ff7d2887ee05ac34f7fe26d78abb8f9a7dd88f6","before":"d1090af87a49afb21460902637b7a986664ae6c6","commits":[{"sha":"4ff7d2887ee05ac34f7fe26d78abb8f9a7dd88f6","author":{"email":"408fd620684987505c00254b33a00267d8b3e2fa@users.noreply.github.com","name":"Yixin Sun"},"message":"Create BalancedBST.java\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/cindysunyixin/LeetCodeSYX/commits/4ff7d2887ee05ac34f7fe26d78abb8f9a7dd88f6"}]}