void _Prev(Node* Proot)
{
Node* cur = Proot;
stack<Node*> s;
while (cur || !s.empty())
{
while (cur)
{
cout << cur->val_ << " ";
s.push(cur);
cur = cur->left_;
}
Node* top = s.top();
if (nullptr != top->right_)
cur = top->right_;
s.pop();
}
cout << endl;
}
二叉树非递归先序遍历(C++)
最新推荐文章于 2023-04-01 14:22:01 发布