請問下列二元樹的中序走訪（inorder traversal）何者正確？

(A) 9,5,3,1,4,8,6,20,12,10,11,30,21,31
(B) 1,3,4,5,6,8,9,10,11,12,20,21,30,31
(C) 1,4,3,6,8,5,11,10,12,21,31,30,20,9
(D) 9,5,20,3,8,12,30,1,4,6,10,21,31,11
答案：B

AI创作