本站最新发布   C#从入门到精通
试听地址  https://www.xin3721.com/eschool/CSharpxin3721/

public void PostOrderTraversalWithoutRecusion2(Action<BinaryTree<T>, int> action) { Stack<NodeWrapper> stack = new Stack<NodeWrapper>(); NodeWrapper wrapper = new NodeWrapper(this, false); stack.Push(wrapper); while (stack.Count > 0) { wrapper = stack.Pop(); if (wrapper.Node.Left != null && !wrapper.FromLeft) { stack.Push(wrapper); stack.Push(new NodeWrapper(wrapper.Node.Left, false)); } else { if(stack.Count > 0) stack.Peek().FromLeft = true; if (wrapper.Node.Right != null && !wrapper.FromRight) { wrapper.FromRight = true; stack.Push(wrapper); stack.Push(new NodeWrapper(wrapper.Node.Right, false)); } else action(wrapper.Node, 1); } } }

测试代码类似非递归版本, 这里为了节省篇幅就不贴了;