【LeetCode】#99恢复二叉搜索树(Recover Binary Search Tree)

【LeetCode】#99恢复二叉搜索树(Recover Binary Search Tree)

题目描述

二叉搜索树中的两个节点被错误地交换。
请在不改变其结构的情况下，恢复这棵树。

示例

示例 1:

输入: [1,3,null,null,2]
1
/
3

2
输出: [3,1,null,null,2]
3
/
1

2

示例 2:

输入: [3,1,4,null,null,2]
3
/
1 4
/
2
输出: [2,1,4,null,null,3]
2
/
1 4
/
3

Description

Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.

Example

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

解法

class Solution {
    TreeNode pre;
    TreeNode m1;
    TreeNode m2;
    public void recoverTree(TreeNode root) {
        helper(root);
        int temp = m1.val;
        m1.val = m2.val;
        m2.val = temp;
    }
    public void helper(TreeNode root){
        if(root==null)
            return;
        helper(root.left);
        if(pre!=null && pre.val>root.val){
            if(m1==null){
                m1 = pre;
                m2 = root;
            }else{
                m2 = root;
            }
        }
        pre = root;
        helper(root.right);
    }
}