Inorder traversal
= Inorder traversal
An <inorder traversal> of a <binary tree> uses <recursion> to visit the left <subtree>, output the current <vertex>, and visit the right <subtree>; an empty <subtree> outputs nothing. This is a <depth-first traversal of a tree> with output between the two recursive calls. It produces sorted keys for a <binary search tree>, but arbitrary labels in a <binary tree> need not appear in <total order>.
// Target: computer-science.bigb