day26--二叉树深度遍历的栈实现 (前序和后序)

前序与中序的区别在于输出顺序不同，后序需要一个输出栈存放输出数据，
代码：

 public void preOrderVisitWithStack() {
        ObjectStack tempStack = new ObjectStack();
        BinaryCharTree tempNode = this;
        while (!tempStack.isEmpty() || tempNode != null) {
            if (tempNode != null) {
                System.out.print("" + tempNode.value + " ");
                tempStack.push(tempNode);
                tempNode = tempNode.leftChild;
            } else {
                tempNode = (BinaryCharTree) tempStack.pop();
                tempNode = tempNode.rightChild;
            } // Of if
        } // Of while
    }// Of preOrderVisitWithStack

    public void postOrderVisitWithStack() {
        ObjectStack tempStack = new ObjectStack();
        BinaryCharTree tempNode = this;
        ObjectStack tempOutputStack = new ObjectStack();

        while (!tempStack.isEmpty() || tempNode != null) {
            if(tempNode != null) {
                tempOutputStack.push(new Character(tempNode.value));
                tempStack.push(tempNode);
                tempNode = tempNode.rightChild;
            } else {
                tempNode = (BinaryCharTree) tempStack.pop();
                tempNode = tempNode.leftChild;
            }// of if
        }// of while
        while (!tempOutputStack.isEmpty()) {
            System.out.print("" + tempOutputStack.pop() + " ");
        }//Of while
    }// of postOrderVisitWithStack

测试用例：

        char[] tempCharArray = {'A','B','C','D','E','F'};
        int[] tempIndicesArray = {0,1,2,4,5,12};
        BinaryCharTree tempTree2 = new BinaryCharTree(tempCharArray,tempIndicesArray);
        System.out.println("\r\nPre-order visit with stack:");
        tempTree2.preOrderVisitWithStack();
        System.out.println("\r\nPost-order visit with stack:");
        tempTree2.postOrderVisitWithStack();

运行结果：

Pre-order visit with stack:
A B D C E F 
Post-order visit with stack:
D B F E C A