In the worst case scenario, what is the smallest Big$-$O upper bound runtime for traversing a BST in terms of n where n is the number of nodes in the BST$?$ Write your answer in Big O format with a capital O and parentheses $($for example, O$(...)).$