那么多新人啊，比08年还差一点# Stock
c*g
1 楼
void inorderTraversalByIteration(TreeNode* root, vector& ret)
{
if(root == 0)
return;
stack s;
s.push(root);
while(s.size() > 0)
{
if(s.top()->left != 0)
{
s.push(s.top()->left);
}else
{
TreeNode* cur = s.top();
s.pop();
ret.push_back(cur->val);
if(cur->right != 0)
s.push(cur->right);
}
}
}
{
if(root == 0)
return;
stack
s.push(root);
while(s.size() > 0)
{
if(s.top()->left != 0)
{
s.push(s.top()->left);
}else
{
TreeNode* cur = s.top();
s.pop();
ret.push_back(cur->val);
if(cur->right != 0)
s.push(cur->right);
}
}
}
