Consider an initially empty tree T$.$ Now perform n consecutive insert operations into T$.$ What is the depth of the root of T after the insertions?

Group of answer choices

n

n$-1$

$0$

log n