Using a stack to perform a pre$-$order traversal of an AVL tree will have a time complexity of:

$O(n*log(n))$

$O(log(n))$

$O(2^n)$

$O(n)$