Which traversal method for a binary tree does the following Pascal code illustrate? ()Proc
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