void InOrder(Node *node)
{
stack<node *> s;
Node *p = node;
while (p||!s.empty())
{
while (p)
{
s.push(p);
p = p->left;
}
if (s.empty())
{
p = s.pop();
visit(p->value);
p = p->right;
}
}
}
中序遍历的非递归实现
最新推荐文章于 2024-06-02 14:26:28 发布