Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 114. Flatten Binary Tree to Linked List

---

參考資訊：
https://www.cnblogs.com/grandyang/p/4293853.html

題目：


解答：

/**
 * 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;
        }

        flatten(root->left);
        flatten(root->right);

        TreeNode *t = root->right;
        root->right = root->left;
        root->left = nullptr;

        while (root->right) {
            root = root->right;
        }
        root->right = t;
    }
};