Which traversal method for a binary tree does the following Pascal code illustra
Which traversal method for a binary tree does the following Pascal code illustrate? procedure traverse (p:pointer); begin if p<>nil then begin traverse(p ↑ .left); process(p); traverse(p ↑ .right); end end;
A．preorder
B．postorder
C．reorder
D．inorder
正确答案：D
词条内容仅供参考，如果您需要解决具体问题
（尤其在法律、医学等领域），建议您咨询相关领域专业人士。