Package linkedlist

Examples of linkedlist.Node

4
5
6
7
8
9
10
public class DoubleLinkedList {
  private Node firstNode = null;

  public DoubleLinkedList(Object data) {
    firstNode = new Node(data);
  }
View Full Code Here
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
  public DoubleLinkedList(Object data) {
    firstNode = new Node(data);
  }

  public void add(int index,Object data) {
    Node currentNode = firstNode;
    int currentIndex = 0;
    try {
      while (currentIndex != index) {
        currentNode = currentNode.getNext();
        currentIndex += 1;
      }
      nodeAdd(currentNode,data,currentIndex);
    }
    catch (java.lang.NullPointerException e) {
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
      System.out.println("Index out of range");
    }
  }

  public void add(Object data) {
    Node currentNode = firstNode;
    int currentIndex = 0;
    while (currentNode.getNext() != null) {
      currentNode = currentNode.getNext();
      currentIndex += 1;
    }
    nodeAdd(currentNode,data,currentIndex);
  }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
    }
    nodeAdd(currentNode,data,currentIndex);
  }

  public void nodeAdd(Node currentNode,Object data,int index) {
    Node newNode = new Node(data);
    if (index == 0) {
      currentNode.setPrevious(newNode);
      newNode.setNext(currentNode);
      firstNode = newNode;
    }
    else {
      newNode.setPrevious(currentNode);
      currentNode.setNext(newNode);
    }
    System.out.println("Data added successfully!");
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
    }
    System.out.println("Data added successfully!");
  }

  public Node remove(int index) {
    Node currentNode = firstNode;
    int currentIndex = 0;
    try {
      while (currentIndex != index) {
        currentNode = currentNode.getNext();
        currentIndex += 1;
      }
      nodeRemove(currentNode,currentIndex);
      return currentNode.getPrevious();
    }
    catch (java.lang.NullPointerException e) {
      System.out.println("Index out of range");
      return firstNode;
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
77
      return firstNode;
    }
  }

  public boolean remove(Object data) {
    Node currentNode = firstNode;
    int currentIndex = 0;
    while (!currentNode.getData().equals(data)) {
      currentNode = currentNode.getNext();
      currentIndex += 1;
    }
    nodeRemove(currentNode,currentIndex);
    return true;
  }
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    nodeRemove(currentNode,currentIndex);
    return true;
  }

  private void nodeRemove(Node currentNode,int index) {
    Node previousNode = currentNode.getPrevious();
    Node nextNode = currentNode.getNext();
    if (index == 0) {
      nextNode.setPrevious(null);
      firstNode = nextNode;
    }
    else {
      previousNode.setNext(nextNode);
      try {
        nextNode.setPrevious(previousNode);
      }
      catch (java.lang.NullPointerException e) {
      }
    }
    System.out.println("Data removed successfully!");
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
    }
    System.out.println("Data removed successfully!");
  }

  public String listIterator() {
    Node currentNode = firstNode;
    String data = "";
    while (currentNode.getNext() != null) {
      data += "\n" + currentNode.getData();
      currentNode = currentNode.getNext();
    }
    data += "\n" + currentNode.getData();
    return data;
  }
View Full Code Here
TOP

Related Classes of linkedlist.Node

  • linkedlist.DoubleLinkedList
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.