Which traversal method for a binary tree does the following Pascal code illustrate? proced

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