{"push_id":836873167,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"5c7d9225b6fbe4830a0150622e26a4fc470c8a96","before":"7dfa1d67e467de49a504e5406c2989ef8bfe1dc8","commits":[{"sha":"5c7d9225b6fbe4830a0150622e26a4fc470c8a96","author":{"email":"a46348088d141eaa69d0bb482d5de3f5d2162d4c@gmail.com","name":"Zekun Wang"},"message":"Create 114 - Flatten Binary Tree to Linked List\n\nGiven a binary tree, flatten it to a linked list in-place.\r\nFor example,\r\nGiven\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","distinct":true,"url":"https://api.github.com/repos/ZekunWang/leetcode/commits/5c7d9225b6fbe4830a0150622e26a4fc470c8a96"}]}