What does the term "inorder successor" refer to in a binary search tree (BST)?

A. The node that comes immediately after a given node in an inorder traversal.

B. The node that comes immediately before a given node in an inorder traversal.

C. The node with the maximum value in the left subtree.

D. The node with the minimum value in the right subtree.

Answer: Option A