A linked list class implemented in Java

LinkedList.java

/*============================================================================
Name        : LinkedList.java
Author      : Eric Swanson
Date		: Sep 7, 2011
Version     : 
Description : 

Copyright (C) 2011 Eric Swanson

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
============================================================================*/

class LinkedList
{
	//Class variables for the Linked List
	private static Node head;
	private static int numNodes;
	
	public LinkedList(Object dat)
	{
		head = new Node(dat);
	}
	
	public void addAtHead(Object dat)
	{
		Node temp = head;
		head = new Node(dat);
		head.next = temp;
		numNodes++;
	}
	
	public void addAtTail(Object dat)
	{
		Node temp = head;
		while(temp.next != null)
		{
			temp = temp.next;
		}
		
		temp.next = new Node(dat);
		numNodes++;
	}
	
	public void addAtIndex(int index, Object dat)
	{
		Node temp = head;
		Node holder;
		for(int i=0; i < index-1 && temp.next != null; i++)
		{
			temp = temp.next;
		}
		holder = temp.next;
		temp.next = new Node(dat);
		temp.next.next = holder;
		numNodes++;
	}
	
	public void addAtIndex(int index, Node node)
	{
		Node temp = head;
		Node holder;
		for(int i=0; i < index-1 && temp.next != null; i++)
		{
			temp = temp.next;
		}
		holder = temp.next;
		temp.next = node;
		temp.next.next = holder;
		numNodes++;
	}
	
	public void deleteAtIndex(int index)
	{
		Node temp = head;
		for(int i=0; i< index - 1 && temp.next != null; i++)
		{
			temp = temp.next;
		}
		temp.next = temp.next.next;
		numNodes--;
	}
	
	public void switchWithNext(int index)
	{
		if(index != 0)
		{
			Node bOne = find(index - 1);
			Node one = find(index);
			Node two = one.next;
			
			one.next = two.next;
			bOne.next = two;
			two.next = one;
		}
		else
		{
			Node one = find(index);
			Node two = one.next;
			
			head = two;
			one.next = two.next;
			two.next = one;
		}
	}	
	
	public static int find(Node n)
	{
		Node t = head;
		int index = 0;
		while(t != n)
		{
			index++;
			t = t.next;
		}
		return index;
	}
	
	public static Node find(int index)
	{
		Node temp=head;
		for(int i=0; i<index; i++)
		{
			temp = temp.next;
		}
		return temp;
	}
		
	public static void printList()
	{
		Node temp = head;
		while(temp != null)
		{
			System.out.print(temp.data + ",");
			temp = temp.next;
		}
		System.out.print("\n");
	}
	
	public static int getSize()
	{
		return numNodes;
	}
	
	class Node
	{
		//Declare class variables
		private Node next;
		private Object data;
		
		public Node(Object dat)
		{
			data = dat;
		}
		
		public Object getData()
		{
			return data;
		}
	}
}

Can i have a more detail explanation please. i'm having lot of difficulty in this type of question.
Can you help me
thanks
please email it to me on nileshparwan.utm.bse16b@gmail.com

Is there any reason for using Object rather than generics?

In method addAtIndex(int index, Object dat), what if index equals to 0? In this case, I want to insert a node at head position. And this function will add after head still.

And in line 99, why we do not use while( ! t.equals(n)) ?

prefer generics over base object!

what happens when we addat() or deleteat() index of 1

@nileshparwan @tail-recursion @carlylou @jiachen247 @sak1122

Thank you for taking the time to read through this code and ask questions. The answer to all of these questions it that I was fresh out of college, had been using Java for barely a year and just didn't know any better.

I apologize for not getting to these questions sooner. When I get some time, I'll loop back and implement some of the feedback you all had. There have been some huge improvements in the past 11 years to Java, and my code could use some updating and documentation :)

Line 98 Perhaps there is a mistake

--- Node bOne = find(index - 1);

Thank you @ericrswanny