对象栈
package datastructure.stack;
/**
* ******************************************
*Circle int queue.
*
* @author Michelle Min MitchelleMin@163.com
* @date 2021-06-12
* ******************************************
*/
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
/**
********************************
* 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(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();
System.out.println("Poped: " + tempChar);
System.out.println("The current stack is:" + tempStack);
}//Of for i
}//Of main
}//Of class ObjectStack
中序遍历
/**
********************************
* 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.println("" + tempNode.value + " ");
tempNode = tempNode.rightChild;
}//Of if
}//Of while
}//Of inOrderVisit
/**
*
* 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();
}// Of main
}// Of BinaryCharTree
question:
原代码80行:of pop写错,应为of if