判断给定C++迭代中序遍历代码遍历指定二叉树的结果是否为4 2 5 1 3 6
指定二叉树的结构：
1
/ \
2 3
/ \ \
4 5 6完整C++代码：
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
void inorderIterative(TreeNode* root) {
stack<TreeNode*> st;
TreeNode* curr = root;
while (curr || !st.empty()) {
while (curr) {
st.push(curr);
curr = curr->left;
}
curr = st.top(); st.pop();
cout << curr->val << " ";
curr = curr->right;
}
}
正在加载题目数据…
子题
该题型需在试卷/作业中作答，单题练习暂不支持
答案解析