$14.$ If we run the following function for a BST$,$ what result will we get?

void fonk $($BTREE root$)($

if$($root$!=$NULL$)\{$ fonk $($root$->$right$),$ printf$("$id$\backslash$t$",$ root$->$data$)$; fonk $($root$->$left$)$;

A$)$ Numbers are listed from smallest to largest

B$)$ Numbers are listed from largest to smallest

C$)$ Inorder traversal

D$)$ Postorder traversal