Data-structures/LL.java at main · av4nth1ka/Data-structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
package ds_endsem;

class Node
{
	int data;
	Node next;
	Node(){
		data=0;
		next=null;
	}
	Node(int d,Node n)
	{
		data=d;
		next=n;
	}
	void print()
	{
		System.out.println(data);
	}
	void setNext(Node p)
	{
		next=p;
	}
	Node getNext()
	{
		return next;
	}
	int getData()
	{
		return data;
	}

}
class LL{
	Node head;
	LL()
	{
		head=null;
	}
	public void insert_to_head(int d)
	{
		if(head==null)
		{
			head=new Node(d,null);
		}
		else
		{
			Node temp=new Node(d,head);
			head=temp;
		}
	}
	public void insert_to_tail(int d)
	{
		Node t=head;
		if(t.getNext()!=null)
		{
			t=t.getNext();
		}
		t.setNext(new Node(d,null));
	}
	public void insert_after(int pos,int d)
	{
		Node temp=head;
		while(pos>1)
		{
			temp=temp.getNext();
			pos--;
		}
		Node newn=new Node(d,temp.getNext());
		temp.setNext(newn);
	}
	public int delete_from_head()
	{
		int val=head.getData();
		head=head.getNext();
		return val;
		}
	public int delete_tail()
	{
		Node t=head;
		Node prev=null;
		while(t.getNext()!=null)
		{
			prev=t;
			t=t.getNext();
		}
		int val=t.getData();
		prev.setNext(null);
		return val;
	}
	public int delete_node(int pos)
	{
		Node temp=head;
		Node prev=head;
		while(pos>1 && temp.getNext()!=null)
		{
			prev=temp;
			temp=temp.getNext();
			pos--;
		}
		int data=temp.getData();
		if(prev==temp)
		{
			head=head.getNext();
		}
		else
		{
			prev.setNext(temp.getNext());
		}
		return data;
	}
	public boolean search_key(int key)
	{
		Node temp=head;
		while(temp!=null)
		{
			if(temp.getData()==key)
			{
				return true;
			}
			temp=temp.getNext();
		}
		return false;
	}
}
public class LList {

	public static void main(String[] args) {
		LL l1=new LL();

		l1.insert_to_head(32);
		l1.insert_to_head(12);
		l1.insert_to_head(90);


	}

}