The numbers 1, 2, .... n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be
p
p + 1
n - p
n - p + 1
This question is part of this quiz :
Top MCQs on Tree Traversal with Interview Question and Answers | DSA Quiz,Gate IT 2005