K12教育赛事综合服务平台
专注青少年竞赛题库网站
聚乐之家官方网站
下载聚乐之家官方App
struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int x): val(x), left(nullptr), right(nullptr) {}}; void dfs(TreeNode* root, vector<int>& result) { if (root == nullptr) return; _________}
result.push_back(root->val); dfs(root->left); dfs(root->right);
result.push_back(root->left->val); dfs(root->right); dfs(root->left);
result.push_back(root->left->val); dfs(root->left); dfs(root->right);
result.push_back(root->right->val); dfs(root->right); dfs(root->left);