{"push_id":973623985,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"874b751be85f9f0326eb338356dfa6f25f8cef37","before":"e0b579852bbe9d87aaaab65086b5d11e8f578233","commits":[{"sha":"874b751be85f9f0326eb338356dfa6f25f8cef37","author":{"email":"edde69039883845c0d320ab5f5a0597c491b9b26@users.noreply.github.com","name":"Ye Hu"},"message":"Create Binary Tree Level Order Traversal\n\nGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).\r\n\r\nFor example:\r\nGiven binary tree {3,9,20,#,#,15,7},\r\n    3\r\n   / \\\r\n  9  20\r\n    /  \\\r\n   15   7\r\nreturn its level order traversal as:\r\n[\r\n  [3],\r\n  [9,20],\r\n  [15,7]\r\n]\r\nconfused what \"{1,#,2,3}\" means? > read more on how binary tree is serialized on OJ.\r\n\r\nSubscribe to see which companies asked this question","distinct":true,"url":"https://api.github.com/repos/sophiehu2509/Practice/commits/874b751be85f9f0326eb338356dfa6f25f8cef37"}]}