114. 二叉树展开为链表

class Solution {
public:
    void flatten(TreeNode* root) {
        vector<TreeNode*> l;
        preorderTraversal(root, l);
        int n = l.size();
        for (int i = 1; i < n; i++) {
            TreeNode *prev = l.at(i - 1), *curr = l.at(i);
            prev->left = nullptr;
            prev->right = curr;
        }
    }

    void preorderTraversal(TreeNode* root, vector<TreeNode*> &l) {
        if (root != NULL) {
            l.push_back(root);
            preorderTraversal(root->left, l);
            preorderTraversal(root->right, l);
        }
    }
};

题解：特殊的后序遍历，右->左->中

114. Flatten Binary Tree to Linked List · leetcode

/**
 *  * Definition for a binary tree node.
 *   * struct TreeNode {
 *    *     int val;
 *     *     TreeNode *left;
 *      *     TreeNode *right;
 *       *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *        *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *         *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 *          * };
 *           */
class Solution {
public:
    void flatten(TreeNode* root) {
        TreeNode* pre = nullptr;
        back_order(root, pre);
    }
    void back_order(TreeNode* root, TreeNode*& pre) {
        if(root == nullptr) {
            return;
        }
        back_order(root->right, pre);
        back_order(root->left, pre);
        root->right = pre;
        root->left = nullptr;
        pre = root;
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode* root) {
        if (!root) {
            return;
        }
        dfs(root);
        //return root;
    }
private:
    TreeNode* dfs(TreeNode* root) {
        if (!root) {
            return nullptr;
        }
        TreeNode* left = root->left;
        TreeNode* right = root->right;
        TreeNode* left_last_node = dfs(root->left);
        TreeNode* right_last_node = dfs(root->right);
        root->left = nullptr;
        if (left_last_node) {
            root->right = left;
            left_last_node->right = right;
        } else {
            root->right = right;
        }
        if (right_last_node) {
            return right_last_node;
        }
        if (left_last_node) {
            return left_last_node;
        }
        return root;
    }
};