stack1.java

和树类似

package ds_java; 
import ds_java.StackInterface;
public class Stack1 implements StackInterface
{
private Object table[];
private final int empty=-1;
private int top=empty;
public Stack1(int n)
{
	table=new Object[n];
	top=empty;
}
 public Stack1()
{
	this(10);
}
public boolean isEmpty()
{
	return top==empty;
}
public boolean isFull()
{
	return top>=table.length;
}
public boolean push(Object k)
{
	if(!isFull())
	{
		top++;
		table[top]=k;
		return true;
	}
	else
	{
		System.out.println("栈已满，"+k+"值无法入栈！");
		return false;
	}
}
public Object pop()
{
	Object k=null;
	if(!isEmpty())
	{
		k=table[top];
		table[top]=null;
		top--;
	}
	return k;
}
public Object get()
{
	if(!isEmpty())
		return table[top];
		else
		return null;	
}
public void output()
{
       int i=0;
	System.out.print("ds_java.Stack1:");
	if(!isEmpty())
	{	
		while(i<table.length)
		{
			if(table[i]!=null)
				System.out.print(table[i]+" ");
            i=i+1;
      
     }
		
		System.out.println();
	}
}
}