day26

前序及后序

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

	public void postOrderVisitWithStack(){
		ObjectStack tempStack = new ObjectStack();
		BinaryCharTree tempNode = this;
		int j;
		BinaryCharTree[] data;
		data = new BinaryCharTree[10];
		j = 0;
		while (!tempStack.isEmpty() || tempNode != null){
			if (tempNode != null){ ;
				j++;
				data[j] = tempNode;
				if(tempNode.leftChild !=null){
					tempStack.push(tempNode.leftChild);
				}
				tempNode = tempNode.rightChild;
			}else{
				tempNode = (BinaryCharTree) tempStack.pop();
			}//Of if
		}//Of while
		for (int i = j; i > 0; i--) {
			System.out.println("" + data[i].value + " ");
		}//Of for i
	}//Of PostOrderVisitWithStack()

	/**
	 * 
	 * The entrance of the program.
	 * 
	 * @param args
	 *            Not used now.
	 * 
	 */
	public static void main(String[] args) {
		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\n The 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\nPreorder 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\n In-order visit with stack:");
		tempTree2.inOrderVisitWithStack();

		System.out.println("\r\n Pre-order visit with stack:");
		tempTree2.PreOrderVisitWithStack();
		System.out.println("\r\n Post-order visit with stack:");
		tempTree2.postOrderVisitWithStack();

	}// Of main