package sllist;

public class Llist<T> {
	
	// fields
	private Lnode<T> head;
	
	// constructors
	public Llist() { head = null;}
	
	
	// methods: isEmpty, insert, remove, remove, display, etc.

	public boolean isEmpty() {
		return true;  // just a stub for now
	}
	
	public void insert(T i) {
		return;  // just a stub for now
	}
			
	public int remove(T i) {
		// remove all nodes with data value == i, if possible
		// return number of items removed from the list
		int count=0;
		// insert some code here
		return count;
	}	
	
	public boolean remove() {
		// remove first node, if possible
		return false; // stub ... return value says operation failed
	}	
	
	public void display() {
		System.out.println("\ndisplaying the list");
		Lnode<T> current = head;
		while (current != null) {
			System.out.print(current.data + "\t");
			current=current.next;
		}
		System.out.println();
		return;
	}	
}