Xiaolun's Tech Zone

static string ReverseSentence(string sentence)
        {
            if (sentence == null)
                throw new ArgumentNullException("sentence");
            if (sentence.Length == 0)
                return sentence;

            char [] senten = new char[sentence.Length];
            for (int i = 0; i < senten.Length; i++) //将整个句子反转
            {
                senten[i] = sentence[senten.Length-1-i];
            }

            int start = 0;
            int length = 0;
            int index = 0;
            string rt = string.Empty;
            char[] word;
            while (index < senten.Length)
            {
                while (index <senten.Length)  //内循环
                {
                    if (senten[index] >= 65 && senten[index] <= 122) //若为字母，则不断对长度加一（单词是连续字母，故可以使用start+length的组合确定一个单词）
                    { 
                        length++;
                        index++;
                    }
                    else // 非字母
                    {
                        if (length == 0) //未发现连续字母
                        {
                            start++;  //调整单词开始位置start
                            rt += senten[index];
                            index++;
                        }
                        break;
                    }
                }
                if (length > 0)  //统计完一个单词，对其反转
                {
                    word = new char[length];
                    for (int i = start; i < start + length; i++)
                    {
                        word[i - start] = senten[i];
                    }
                    for (int i = 0; i < word.Length; i++)
                    {
                        rt += word[word.Length - i - 1];
                    }
                    start = start + length;
                    length = 0;
                }
            }
            return rt;

        }

　　周末闲来无事，突然想到了二叉树的遍历问题，如果考虑用递归算法的话比较简单，但是如果用空间换取时间的话，考虑用辅助数据结构：栈来解决遍历的问题，代码如下：   

    //非递归后序遍历二叉树
        static void PostOrder(BinaryTreeNode root)
        {
            Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();

          BinaryTreeNode curr = root;
            while (curr != null)
            {
                stack.Push(curr );
                curr = curr .Left;
            }
            BinaryTreeNode tmp = null;
            BinaryTreeNode last = null;
            while (stack.Count > 0)
            {
                tmp = stack.Peek();
                if (tmp.Right == null || tmp.Right == last) //关键点：栈顶元素的右孩子为空或者为刚刚访问过的节点时才弹出并输出
                {
                    tmp = stack.Pop();
                    last = tmp;
                    Console.WriteLine(tmp.Data);
                }
                else
                {
                    tmp = tmp.Right;//右孩子不为空入栈

                    stack.Push(tmp);
                    while (tmp.Left != null)//并将右孩子的所有左子孙节点入栈
                    {
                        stack.Push(tmp.Left);
                        tmp = tmp.Left;
                    }
                }
            }

        }

       //非递归前序遍历二叉树

        static void PrevOrder(BinaryTreeNode root)
        {
            Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();

            stack.Push(root);
            BinaryTreeNode tmp = null;
            while (stack.Count >0)
            {
                tmp = stack.Pop();
                Console.WriteLine(tmp.Data);
                if (tmp.Right != null)
                    stack.Push(tmp.Right); //右孩子节点不为空入栈,因为要先输出左孩子，鉴于栈的特点是先入后出，所以先入右孩子
                if (tmp.Left != null)
                    stack.Push(tmp.Left);//左孩子节点不为空入栈

            }
        }

        //非递归中序遍历二叉树
        static void MiddleOrder(BinaryTreeNode root)
        {
            Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();

           BinaryTreeNode curr = root;
            while (curr!= null)
            {
                stack.Push(curr);
                curr= curr.Left;
            }
            BinaryTreeNode tmp = null;
            while (stack.Count > 0)
            {
                tmp = stack.Pop();//与后续遍历的差别是：输出的时候检测右孩子是否为空，或者右孩子是否刚刚访问过
                Console.WriteLine(tmp.Data);
                tmp = tmp.Right;
                if (tmp != null)
                {
                    stack.Push(tmp);
                    while (tmp.Left != null)
                    {
                        stack.Push(tmp.Left);
                        tmp = tmp.Left;
                    }
                   
                }
            }
        }

测试通过的代码：http://files.cnblogs.com/shiyulun1984/test.rar

欢迎拍砖！