单选题：The space complexity of iteratively traversing a binary tree wit

The space complexity of iteratively traversing a binary tree with $$N$$ nodes and height $$H$$ in inorder (with the help of an auxiliary stack) is __. @[B](3)

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




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


答案：B