Method inorder

14. Tree/Recover-Binary-Tree.java:17–32

(TreeNode root)

  }

  private void inorder(TreeNode root) {

    if (root == null) {
      return;
    }
    inorder(root.left);
    if (prev != null && prev.val > root.val) {
      if (a == null) {
        a = prev;
      }
      b = root;
    }
    prev = root;
    inorder(root.right);

  }

  public class TreeNode {