void traverse(TreeNode* root) {
  if (root == nullptr) return;
  cout << root->val << " ";
  traverse(root->left);
  traverse(root->right);
}