找到搜索二叉树中两个错误的节点

package main
import . "nc_tools"
/*
 * type TreeNode struct {
 *   Val int
 *   Left *TreeNode
 *   Right *TreeNode
 * }
 */

/**
 * 
 * @param root TreeNode类 the root
 * @return int整型一维数组
*/
func findError( root *TreeNode ) []int {
    var a,b int
    arr:=order(root)
    for i,x:=range arr{
        if i>0&&x<arr[i-1]{
            if a==0{
                a,b=arr[i-1],x
            }else{
                b=x
                break
            }
        }
    }
    if a>b{
        return []int{b,a}
    }
    return []int{a,b}
}

func order(root *TreeNode)[]int{
    if root==nil{
        return nil
    }
    ans:=[]int{}
    ans=append(ans,order(root.Left)...)
    ans=append(ans,root.Val)
    ans=append(ans,order(root.Right)...)
    return ans
}

package main
import . "nc_tools"
/*
 * type TreeNode struct {
 *   Val int
 *   Left *TreeNode
 *   Right *TreeNode
 * }
 */

/**
 * 
 * @param root TreeNode类 the root
 * @return int整型一维数组
*/
var idx, prev, tmp int
const MIN_VALUE  = -65535
func findError( root *TreeNode ) []int {
    idx, prev, tmp = 1, MIN_VALUE, 0
    res := make([]int, 2)
    inorder(root, res)
    if idx == 0 {
        res[idx] = tmp
    }
    return res
}

func inorder(root *TreeNode, res []int)  {
    if root == nil {
        return
    }    
    inorder(root.Left, res)
    if prev != MIN_VALUE {
        if root.Val < prev {
            if idx == 1 {
                res[idx] = prev
                tmp = root.Val
            } else {
                res[idx] = root.Val
                tmp = prev
            }
            idx--
        }
    }

    prev = root.Val
    inorder(root.Right, res)
}