Flag question

What does this method do:

Node fun$($Node node$)\{$

Node current $=$ node;

while $($current$.$left $$ null$)\{$

current $=$ current.left;

$\}$

return current;

$\}$

A$.$ Return minimum node in AVL.

B$.$ Will not compile the loop is not correct.

C$.$ Return null.

D$.$ Return last parent node in most left subtree.