Consider a binary search tree (BST) with leaf nodes (). Given any node , the key present in the node is denoted as . All the keys present in the given BST are distinct. The keys belong to the set of real numbers.
For a node , let denote the node that is its inorder successor. If a node does not have an inorder successor, then is NULL. As there are no duplicates, if is not NULL, then .
Corresponding to every leaf node that has a non-NULL , a new key with the following property is to be inserted into the BST.
Let represent the list of all such new keys to be inserted into the BST.
Which of the following statements is/are true?
- Acannot have any duplicates
- Bwill have at least one element
- CAfter inserting all keys from , the height of the BST can increase at most by one
- DNumber of nodes in the BST will double after inserting all keys from

