Starting from an empty binary search tree, we insert n nodes. What can we say about the shape of the tree?
A. The shape of the tree is determined by the order in which the nodes are inserted.
B. The shape of the tree is always a balanced binary tree.
C. The shape of the tree is random and cannot be determined.
D. The shape of the tree depends on the value of n.