遞歸

void flatten(TreeNode *root) {// Note: The Solution object is instantiated only once and is reused by each test case.flat(root);}TreeNode* flat(TreeNode* root){if(!root)return NULL;TreeNode* left_tail = flat(root->left);TreeNode* right_tail = flat(root->right);if(left_tail){left_tail->right = root->right;root->right = root->left;root->left = NULL;}if(right_tail)return right_tail;if(left_tail)return left_tail;return root;}

　　

轉載于:https://www.cnblogs.com/summer-zhou/p/3384764.html

總結

以上是生活随笔為你收集整理的【second】Flatten Binary Tree to Linked List的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。