Consider a binary search tree whose nodes store distinct values. We can print off the values stored in the tree in ascending order by doing one of the following recursively $($some details such as base case omitted$)$:

A$.$ traverse$($v$)\{$ traverse$($v$.$left$\_$child$)$; print $($v$.$value$)$; traverse$($v$.$right$\_$child$)\}$

B$.$ traverse$($v$)\{$ print$($v$.$value$)$; traverse$($v$.$left$\_$child$)$; traverse$($v$.$right$\_$child$)\}$

C$.$ traverse$($v$)\{$ traverse$($v$.$left$\_$child$)$; traverse$($v$.$right$\_$child$)$; print$($v$.$value$)\}$

In either case our first call would be traverse$($BST$.$root$).$

In the choices above, the format is function$($args$)\{$ body $\}$

Group of answer choices

B

C

A