Which statement about Perfect Binary Tree is correct?

A. constant factors and lower-order terms are ignored asymptotically B. it may examine every element C. every level is completely filled D. collisions must be handled when keys map to the same position