Which of the following operations on a reference based binary search tree has a worst case time complexity of O$(1)?$

Question $5$ options:

A$)$

all of the listed choices

B$)$

determine the number of children for a given node

C$)$

determine if a node is an internal node

D$)$

determine if a node is the root node