OZ Programming Language:

Given below is a way to traverse in preorder.

Design the other strategies, inorder and postorder.

declare Root-node (left:X1 right:X2 value:0) X1=node (left:X3 right:X4 value : 1) X2=node (left : X5 right:X6 value : 2) x3-node (left:nil right:nil value:3) x4-node (left:nil right:nil value:4) x5-node (left:nil right:nil value:5) x6 node (left:nil right:nil value: 6) (Browse Root proc Preorder x if X \= nil then {Browse x.value} if .left \-nil then {Preorder X.left} end if x.right -nil then Preorder x.right end end end Preorder Root