Scan binary tree in infix order


procedure output_infix( t : tree ); begin if t <> nil then begin output_infix( t^.left ); output( t^.key ); output_infix( t^.right ); end end;

Pascal source (426.infix.p)


© Addison-Wesley Publishing Co. Inc.