Assuming the items are inserted in order sorted into an empty binary search tree T, then the depth of such a tree is

A)N

B)N-1

C)N+1

D)logN

Assuming the items are inserted in order sorted into an empty binary search tree T, then the depth of such a tree is

A)N

B)N-1

C)N+1

D)logN