inorder traversal of binary tree the standard preorderpostorderand breadth-first traversals that were introduced for general treescan be directly applied to binary trees in this sectionwe introduce another common traversal algorithm specifically for binary tree during an inorder traversalwe visit position between the recursive traversals of its left and right subtrees the inorder traversal of binary tree can be informally viewed as visiting the nodes of "from left to right indeedfor every position pthe inorder traversal visits after all the positions in the left subtree of and before all the positions in the right subtree of pseudo-code for the inorder traversal algorithm is given in code fragment and an example of an inorder traversal is portrayed in figure algorithm inorder( )if has left child lc then inorder(lc{recursively traverse the left subtree of pperform the "visitaction for position if has right child rc then inorder(rc{recursively traverse the right subtree of pcode fragment algorithm inorder for performing an inorder traversal of subtree rooted at position of binary tree figure inorder traversal of binary tree the inorder traversal algorithm has several important applications when using binary tree to represent an arithmetic expressionas in figure the inorder traversal visits positions in consistent order with the standard representation of the expressionas in / (albeit without parentheses