public void postOrder3(Node Root)
	{
		if(Root==null) return;
		this.recoverVisited(Root);
		Stack<Node> s = new Stack<Node>();
		Node cur = Root;
		while((cur!=null&& cur.visited==0)||!s.isEmpty())
		{
			//左结点访问结束的标志是 pre为空
			while(cur!=null && cur.visited==0)
			{
				s.push(cur);
				cur = cur.left;
				
			}
			if(!s.isEmpty())
			{
				cur = s.pop();
					if (cur.right!=null && cur.right.visited==0) {
					s.push(cur);
					cur = cur.right;
				}
				else visit(cur);
				
				
			}
			
		}
	}