Which of the following implementations A and $B$ are used to count the internal nodes in a binary tree? An In

Time

node that has at least one child.

$\frac{\frac{?}{?}}{A}$

int countInternal$($Node$*$ root$)\{$

if root $==$ nullptr $||$ root $$ left $==$ nullptr && root$->$right $==$ nullptr