Consider a BinarySearchTree T$0,$ containing N numerical values, whose root is the median value of the tree. $($The median value is the value such that half of the values are less and the other half are greater.$)$

Suppose that N additional values are added to the tree T$0,$ using the standard insertion algorithm, to create an updated tree T$1.$ The newly added values are all larger than the largest value that T$0$ stored, and they are added in an unknown order.

Note: N refers both to the original number of nodes in T$0$ and to the number of nodes added to T$0$ to create T$1.$ Hence T$1$ contains $2$N nodes. You may assume N $>0.$

Which of these statements is$/$are true about the creation of T$1?$