Day_25二叉树深度遍历的栈实现 (中序)

遇到的问题:

今天我的主要问题就是要了解中序遍历(非递归)的逻辑运算过程,从构建栈开始,到每一步的判断,再到出栈,进栈.关键是了解其背后的逻辑运算,只有这样才能看得懂代码.

解决方法:

构建一个栈

创建工作指针,

首先将工作指针指向根节点,然后开始循环(while)

假如工作指针不为空,或者栈内有元素,则进行循环{

        如果工作指针不为空的话{

                工作指针指向的空间入栈,工作指针指向工作指针的左孩子

        }否则{

                栈内元素出栈,并且输出元素的值,工作指针指向出栈元素的右孩子.

        }

}

这一段为代码的核心逻辑,其背后的讲解详见数据结构第五章树.

代码展示:

第一个通用栈的主函数代码:

package Day_25;

public class demo1 {
    /**
     *********************
     * The entrance of the program.
     *
     * @param args
     *            Not used now.
     *********************
     */
    public static void main(String args[]) {
        ObjectStack tempStack = new ObjectStack();

        for (char ch = 'a'; ch < 'm'; ch++) {
            tempStack.push(new Character(ch));
            System.out.println("The current stack is: " + tempStack);
        } // Of for i

        char tempChar;
        for (int i = 0; i < 12; i++) {
            tempChar = ((Character)tempStack.pop()).charValue();
            System.out.println("Poped: " + tempChar);
            System.out.println("The current stack is: " + tempStack);
        } // Of for i
    }// Of main
}

通用栈的调用函数类:

package Day_25;

    /**
     * Circle int queue.
     *
     * @author Fan Min minfanphd@163.com.
     */
    public class ObjectStack {

        /**
         * The depth.
         */
        public static final int MAX_DEPTH = 10;

        /**
         * The actual depth.
         */
        int depth;

        /**
         * The data
         */
        Object[] data;

        /**
         *********************
         * Construct an empty sequential list.
         *********************
         */
        public ObjectStack() {
            depth = 0;
            data = new Object[MAX_DEPTH];
        }// Of the first constructor

        /**
         *********************
         * Overrides the method claimed in Object, the superclass of any class.
         *********************
         */
        public String toString() {
            String resultString = "";
            for (int i = 0; i < depth; i++) {
                resultString += data[i];
            } // Of for i

            return resultString;
        }// Of toString

        /**
         *********************
         * Push an element.
         *
         * @param paraObject
         *            The given object.
         * @return Success or not.
         *********************
         */
        public boolean push(Object paraObject) {
            if (depth == MAX_DEPTH) {
                System.out.println("Stack full.");
                return false;
            } // Of if

            data[depth] = paraObject;
            depth++;

            return true;
        }// Of push

        /**
         *********************
         * Pop an element.
         *
         * @return The object at the top of the stack.
         *********************
         */
        public Object pop() {
            if (depth == 0) {
                System.out.println("Nothing to pop.");
                return '\0';
            } // of if

            Object resultObject = data[depth - 1];
            depth--;

            return resultObject;
        }// Of pop

        /**
         *********************
         * Is the stack empty?
         *
         * @return True if empty.
         *********************
         */
        public boolean isEmpty() {
            if (depth == 0) {
                return true;
            }//Of if

            return false;
        }// Of isEmpty


    }//Of class ObjectStack

第二个主函数类(树的非递归中序遍历)

package Day_25;

import Day_21.BinaryCharTree;

import java.util.Arrays;

public class demo2 {

    /**
     *********************
     * The entrance of the program.
     *
     * @param args Not used now.
     *********************
     */
    public static void main(String args[]) {
        /*BinaryCharTree tempTree = new BinaryCharTree();
        tempTree.manualConstructTree();
        System.out.println("\r\nPreorder visit:");
        tempTree.preOrderVisit();
        System.out.println("\r\nIn-order visit:");
        tempTree.inOrderVisit();
        System.out.println("\r\nPost-order visit:");
        tempTree.postOrderVisit();

        System.out.println("\r\n\r\nThe depth is: " + tempTree.getDepth());
        System.out.println("The number of nodes is: " + tempTree.getNumNodes());

        tempTree.toDataArrays();
        System.out.println("The values are: " + Arrays.toString(tempTree.valuesArray));
        System.out.println("The indices are: " + Arrays.toString(tempTree.indicesArray));

        tempTree.toDataArraysObjectQueue();
        System.out.println("Only object queue.");
        System.out.println("The values are: " + Arrays.toString(tempTree.valuesArray));
        System.out.println("The indices are: " + Arrays.toString(tempTree.indicesArray));*/

        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:");
        tempTree2.preOrderVisit();
        System.out.println("\r\nIn-order visit:");
        tempTree2.inOrderVisit();
        System.out.println("\r\nPost-order visit:");
        tempTree2.postOrderVisit();

        System.out.println("\r\nIn-order visit with stack:");
        tempTree2.inOrderVisitWithStack();






    }// Of main
}

补充在BinaryCharTree类里面的代码:

    //第25天补充代码:
    /**
     *********************
     * In-order visit with stack.
     *********************
     */
    public void inOrderVisitWithStack() {
        ObjectStack tempStack = new ObjectStack();
        BinaryCharTree tempNode = this;
        while (!tempStack.isEmpty() || tempNode != null) {
            if (tempNode != null) {
                tempStack.push(tempNode);
                tempNode = tempNode.leftChild;
            } else {
                tempNode = (BinaryCharTree) tempStack.pop();
                System.out.print("" + tempNode.value + " ");
                tempNode = tempNode.rightChild;
            } // Of if
        } // Of while
    }// Of inOrderVisit

运行结果:

第一个主函数类运行的结果;

 

 第二个主函数类运行结果: