inorder(ttTree)
// Traverses the nonempty 2-3 tree, ttTree, in sorted
// search-key order
.  
.  if (ttTree's root node r is a leaf
.  {
.  .  visit the data item(s)
.  }
.  else if (r has two data items)
.  {
.  .  inorder(left subtree of ttTree's root).  
.  .  Visit the first data item
.  .  inorder(middle subtree of ttTree's root)
.  .  Visit the second data item
.  .  inorder(right subtree of ttTree's root)
.  }
.  else // r has one data item
.  {
.  .  inorder(left subtree of ttTree's root)
.  .  Visit the data item
.  .  inorder(right subtree of ttTree's root)
.  }  // end if / else if / else