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 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