Which traversal method for a binary tree does the following Pascal code illustrate ( ) Procedure traverse(p:pointer) Begin If p＜＞nilthen begin traverse(p↑.left); process(p); traverse(p↑.right); endend;

A．preorder

B．postorder

C．reorder

D．inorder