Let $p$ be a position within tree T$.$ Algorithm depth$($p$)$ should run in $O(n)q,$ worst$-$case time $($given in Big$-$O notation$)?$

$O(logn)$

$O(nlogn)$

none of the above