单项选择题

8 By ( ) traversing the binary sort tree, we can get the non decreasing sequence of key values of each node.

A.inorder
B.level
C.postorder
D.preorder