store/works/solutions/leetcode/cpp/897.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    std::vector<TreeNode*> result;

    void InOrderTraverse(TreeNode* root) {
        if (root->left != nullptr)
            InOrderTraverse(root->left);
        result.push_back(root);
        if (root->right != nullptr)
            InOrderTraverse(root->right);
    }

    TreeNode* increasingBST(TreeNode* root) {
        InOrderTraverse(root);

        const auto end = result.end();
        auto iter1 = result.begin();
        auto iter2 = result.begin() + 1;
        for (; iter2 != end; ++iter1, ++iter2) {
            const auto node = *iter1;
            node->left = NULL;
            node->right = *iter2;
        }
        (*iter1)->left = (*iter1)->right = NULL;

        return result.front();
    }
};