Compare inorder, preorder, postorder traversals with use cases.

void inorder(TreeNode n) {
  if (n == null) return;
  inorder(n.left);
  visit(n);
  inorder(n.right);
}