{"push_id":722323261,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a01904d74f8c91bc5e1cf8ccc8ac79be99abddfc","before":"7984841d0a7a974dcb84327a35019d65dacdbacc","commits":[{"sha":"a01904d74f8c91bc5e1cf8ccc8ac79be99abddfc","author":{"email":"fd7c2717538b92f80f9a2db4c6231f58150c5ddc@Roberts-MacBook-Air.local","name":"Robert Meng"},"message":"Q110: Balanced Binary Tree\n\nAn empty tree is height-balanced. A non-empty binary tree T is balanced\nif:\n1) Left subtree of T is balanced\n2) Right subtree of T is balanced\n3) The difference between heights of left subtree and right subtree is\nnot more than 1.","distinct":true,"url":"https://api.github.com/repos/robertzm/algotest/commits/a01904d74f8c91bc5e1cf8ccc8ac79be99abddfc"}]}