大牛帮我看看这哪错了? iterative inorder traversal# JobHunting - 待字闺中
C*n
1 楼
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector inorderTraversal(TreeNode *root) {
vector ret;
if(root) {
stack stack;
stack.push(root);
TreeNode* top = stack.top();
while(!stack.empty() || top!=NULL){
while(top->left!=NULL){
stack.push(top->left);
top = top->left;
}
top = stack.top();
ret.push_back(top->val);
stack.pop();
top = top->right;
}
}
return ret;
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector
vector
if(root) {
stack
stack.push(root);
TreeNode* top = stack.top();
while(!stack.empty() || top!=NULL){
while(top->left!=NULL){
stack.push(top->left);
top = top->left;
}
top = stack.top();
ret.push_back(top->val);
stack.pop();
top = top->right;
}
}
return ret;
}
};
