{"push_id":651208798,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d2fecc33c831b8a934bb6863af7f04058880fde3","before":"9474809d23c5a9d84b366f6da4b6217962c7bc03","commits":[{"sha":"d2fecc33c831b8a934bb6863af7f04058880fde3","author":{"email":"7889b2150fd91a242f3c01ae04149811c467ab25@msn.cn","name":"swordsx"},"message":"Create Symmetric Tree.py\n\n非递归解法：两遍BFS，方向相反。各自返回一个带None的list，比较两个list是否相等。","distinct":true,"url":"https://api.github.com/repos/swordsx/leetcode/commits/d2fecc33c831b8a934bb6863af7f04058880fde3"}]}