*leetcode #99 in cpp

Two elements of a binary search tree (BST) are swapped by mistake.

Recover the tree without changing its structure.

Note:
A solution using O( n ) space is pretty straight forward. Could you devise a constant space solution?

Solution:

A valid BST would have node values in increasing order when perform in-order traverse. In-order traversal would give a sorted list. 

Thus swapping two numbers would break the increasing order. It is to put one small number in between larger numbers and put a large number in between smaller numbers. To find out the two numbers breaking the order, we first perform in-order traversal in the tree. And we start from the begin of the list to find the first number that is bigger than its successor. Once we find it, we start from the end of the list to find the first number that is smaller than its precedents. Then we swap these two numbers. 

Code:

/**
 * 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:
    void recoverTree(TreeNode* root) {
        vector<TreeNode*> nodes;
        inOrderTraversal(root, nodes);
        TreeNode* node1 = root;
        TreeNode* node2 = root;
        
        for(int i = 0; i < nodes.size(); i++){
            if(i+1 < nodes.size() && nodes[i]->val >= nodes[i+1]->val){
                node1 = nodes[i];
                break;
            }
        }
        for(int i = nodes.size() - 1; i >=0; i --){
            if(i-1>=0 && nodes[i]->val <= nodes[i-1]->val){
                node2= nodes[i];
                break;
            }
        }
        int temp = node1->val;
        node1->val = node2->val;
        node2->val = temp;
        return;
    }
    void inOrderTraversal(TreeNode* &node, vector<TreeNode*> &nodes){
        if(!node) return;
        inOrderTraversal(node->left, nodes);
        nodes.push_back(node);
        inOrderTraversal(node->right, nodes);
    }  
    
};