二叉树中序遍历（非递归）

二叉树中序遍历（非递归）

(2010-03-15 15:50:22)

标签： 杂谈

分类： 算法

        public void MidStackOrder()
        {
            Stack<Node> stack = new Stack<Node>();
            Node node = _head;

            while (node != null || stack.Count > 0)
            {
                while (node != null)
                {
                    stack.Push(node);
                    node = node.left;
                }

                if (stack.Count > 0)
                {
                    node = stack.Pop();
                    Console.WriteLine(node);
                    node = node.right;
                }
            }
        }