Oz programming language:

We have seen a way to traverse in preorder (first the root, then the left child, followed by the right child). It is: 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 x.left il then Preorder x.left end f X.right-nil then { Preorder X.right) end end end Preorder Root Design the other known strategies, namely traverse in inorder (first the left child, then the root, followed by the right child) and postorder (first the left child, then the right child, followed by the root)