// post-order traversal of a binary tree: left subtree, root, right subtree.

void traversal(b_tree* n) {
  if(!n->left && !n->right) {
    cout << n;
  }
  else {
    traversal(n->left);
    traversal(n->right);
    cout << n;
  }
}