[单选题]In order to traverse the binary tree, the successor of the node v in the order traversal is (assuming that the successor of v exists):对二叉树进行中序遍历，节点v在中序遍历下的后继为（假设v的后继存在）：7hN答案窝(daanwo.com)-大学生作业答案及考资分享平台
AThe first visited node in its right subtree其右子树中第一个被访问的节点7hN答案窝(daanwo.com)-大学生作业答案及考资分享平台
BThe first visited node in its left subtree其左子树中第一个被访问的节点7hN答案窝(daanwo.com)-大学生作业答案及考资分享平台
CThe first visited node in its right subtree or an ancestor of v其右子树中第一个被访问的节点或v的某个祖先7hN答案窝(daanwo.com)-大学生作业答案及考资分享平台
DThe first node in its right subtree or a node in its left subtree其右子树中第一个被访问的节点或其左子树中的某个节点