二叉树非递归中序遍历(C++)

void _InOrder(Node* Proot)
	{
		/*if (nullptr == Proot)
			return;*/
		Node* cur = Proot;
		stack<Node*> s;

		while (cur || !s.empty())
		{
			while (cur)
			{
				s.push(cur);
				cur = cur->left_;
			}

			Node* top = s.top();
			cout << top->val_ << " ";
			s.pop();
			
			if (nullptr != top->right_)
				cur = top->right_;
		}
		cout << endl;
	}