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 Ifp<>NIL Then begin Traverse (p^．left)； Process(p)； Traverse(p^．right) End； End_
A．pre_order
B．middle_order
C．none
D．last_order
正确答案：B
词条内容仅供参考，如果您需要解决具体问题
（尤其在法律、医学等领域），建议您咨询相关领域专业人士。