题解 | #找到搜索二叉树中两个错误的节点#

/*
 * function TreeNode(x) {
 *   this.val = x;
 *   this.left = null;
 *   this.right = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param root TreeNode类 the root
 * @return int整型一维数组
 */
function findError( root ) {
    // write code here
    let first = null, second = null, prev = null;

  function inorder(node) {
    if (!node) return;

    inorder(node.left);

    if (prev && prev.val > node.val) {
      if (!first) {
        first = prev;
      }
      second = node;
    }
    prev = node;

    inorder(node.right);
  }

  inorder(root);

  return [first.val, second.val].sort((a, b) => a - b);
}
module.exports = {
    findError : findError
};