[WXM] LeetCode 99. Recover Binary Search Tree C++

最新推荐文章于 2018-09-06 17:11:08 发布

WX_ming

最新推荐文章于 2018-09-06 17:11:08 发布

阅读量196

点赞数

分类专栏： Tree

本文链接：https://blog.csdn.net/WX_ming/article/details/82313999

版权

Tree 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

99. Recover Binary Search Tree

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

Recover the tree without changing its structure.

Example 1:

Input: [1,3,null,null,2]

   1
  /
 3
  \
   2

Output: [3,1,null,null,2]

   3
  /
 1
  \
   2

Example 2:


Input: [3,1,4,null,null,2]

  3
 / \
1   4
   /
  2

Output: [2,1,4,null,null,3]

  2
 / \
1   4
   /
  3

Follow up:

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

Approach

题目大意二叉搜索树中有两个元素位置错误，需要你将它们重新交换回去，并不破坏原先的结构。这道题不难，二叉搜索数有一个性质就是中序即升序，那么你只要遍历升序的时候找到两个异常的元素结点即可。

Code

class Solution {
public:
    TreeNode* lastNode;
    TreeNode* firstNode;
    TreeNode* secondNode;
    void inorderTraval(TreeNode* root) {
        if (root == nullptr)return;
        inorderTraval(root->left);
        if (lastNode != nullptr&&firstNode == nullptr&&lastNode->val >= root->val)
            firstNode = lastNode;
        if (lastNode != nullptr&&firstNode != nullptr&&lastNode->val >= root->val)
            secondNode = root;
        lastNode = root;
        inorderTraval(root->right);
    }
    void recoverTree(TreeNode* root) {
        inorderTraval(root);
        swap(firstNode->val, secondNode->val);
    }
};