{"push_id":539719123,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7532858adb1b9f3932170b03b0a11436e4b18eb2","before":"f2c2bdc0156cc64e573b9749d526144f4ed8bd81","commits":[{"sha":"7532858adb1b9f3932170b03b0a11436e4b18eb2","author":{"email":"5ad772bf4b69bcbdc717b0d45d7fe137cda6c33c@gmail.com","name":"Sean"},"message":"Create flatten-binary-tree-to-linked-list.py\n\nGiven a binary tree, flatten it to a linked list in-place.\r\n\r\nFor example,\r\nGiven\r\n\r\n         1\r\n        / \\\r\n       2   5\r\n      / \\   \\\r\n     3   4   6\r\nThe flattened tree should look like:\r\n   1\r\n    \\\r\n     2\r\n      \\\r\n       3\r\n        \\\r\n         4\r\n          \\\r\n           5\r\n            \\\r\n             6\r\nclick to show hints.\r\n\r\nHints:\r\nIf you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.","distinct":true,"url":"https://api.github.com/repos/shuaishao299792458/leetcode/commits/7532858adb1b9f3932170b03b0a11436e4b18eb2"}]}