File tree Expand file tree Collapse file tree 1 file changed +72
-0
lines changed Expand file tree Collapse file tree 1 file changed +72
-0
lines changed Original file line number Diff line number Diff line change
1
+ /*
2
+ Linked List Implementation
3
+
4
+ */
5
+ class Node {
6
+ int data ;
7
+ Node next ;
8
+ Node prev ;
9
+
10
+ public Node () {
11
+
12
+ next = null ;
13
+ prev = null ;
14
+ }
15
+
16
+ }
17
+ class LinkedList {
18
+ Node head = new Node ();
19
+ Node tail = new Node ();
20
+
21
+ boolean insertFront (int newData ) {
22
+ Node newNode = new Node ();
23
+ newNode .data = newData ;
24
+
25
+ if (head == null ) {
26
+ head = newNode ;
27
+ tail = head ;
28
+ return true ;
29
+ }
30
+ else {
31
+ Node oldHead = head ;
32
+ head = newNode ;
33
+ head .next = oldHead ;
34
+ oldHead .prev = head ;
35
+ return true ;
36
+ }
37
+ }
38
+
39
+ boolean insertTail (int newData ) {
40
+ Node newNode = new Node ();
41
+ newNode .data = newData ;
42
+ if (head == null ) {
43
+ head = newNode ;
44
+ tail = head ;
45
+ return true ;
46
+ }
47
+ else {
48
+ //Node oldTail = tail;
49
+ newNode .prev = tail ;
50
+ tail .next = newNode ;
51
+ tail = newNode ;
52
+ return true ;
53
+ }
54
+ }
55
+ int delete (int data ) {
56
+ return 0 ;
57
+ }
58
+ void printList (){
59
+ Node cur = head ;
60
+ while (cur != null ) {
61
+ System .out .println (cur .data );
62
+ cur = cur .next ;
63
+ }
64
+ }
65
+ public static void main (String [] args ) {
66
+ LinkedList ll = new LinkedList ();
67
+ ll .insertFront (30 );
68
+ ll .insertFront (20 );
69
+ ll .insertFront (10 );
70
+ ll .printList ();
71
+ }
72
+ }
You can’t perform that action at this time.
0 commit comments