inorder another variation of the algorithms defined in ss and ss is that of inorder traversal where the value of the current node is yielded in between traversing the left subtree and the right subtree an example of inorder traversal is shown in figure ( ( ( ( ( (ffigure inorder visit binary search tree example algorithm inorder(root preroot is the root node of the bst postthe nodes in the bst have been visited in inorder if root inorder(root left yield root value inorder(root right end if end inorder one of the beauties of inorder traversal is that values are yielded in their comparison order in other wordswhen traversing populated bst with the inorder strategythe yielded sequence would have property xi <xi+