QUESTION $10$

The preorder traversal algorithm runs in $\_\_\_\_\_\_\_\_\_$ time for a tree with n elements.

O$($n$)$

O$($log n$)$

O$($n log n$)$

O$($n$2)$