请将下列树的深度优先遍历代码补充完整，横线处的容器类型应填：
void dfs(TreeNode* root) {
if (!root) return;
______<TreeNode*> temp; // 填写
temp.push(root);
while (!temp.empty()) {
TreeNode* node = temp.top(); temp.pop();
cout << node->val << " ";
if (node->right) temp.push(node->right);
if (node->left) temp.push(node->left);
}
}
- A. vector
- B. list
- C. queue
- D. stack
正确答案：D