单选题：The time complexity of recursively traversing a binary tree with

The time complexity of recursively traversing a binary tree with $$N$$ nodes and height $$H$$ in preorder is __. @[A](2)

A. $$O(N)$$
B. $$O(H)$$
C. $$O(N\log H)$$
D. $$O(H\log N)$$




A.$$O(N)$$
B.$$O(H)$$
C.$$O(N\log H)$$
D.$$O(H\log N)$$


答案：A