Scribd Logo
Upload

Welcome to Scribd!

  • List Node

    Uploaded by

    Никола Николић
    4 views3 pages
    This document defines a ListNode class that represents nodes in a doubly linked list. The class contains fields for the node's item and next/previous node references. It implements various methods for printing, inserting, and deleting nodes from the list. These methods manipulate the next and prev references to manage connections between nodes.

    Original Description:

    Druga klasa za zadatak uvezanih lista u Javi.

    Original Title

    ListNode

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines a ListNode class that represents nodes in a doubly linked list. The class contains fields for the node's item and next/previous node references. It implements various methods for printing, inserting, and deleting nodes from the list. These methods manipulate the next and prev references to manage connections between nodes.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views3 pages

    List Node

    Uploaded by

    Никола Николић
    This document defines a ListNode class that represents nodes in a doubly linked list. The class contains fields for the node's item and next/previous node references. It implements various methods for printing, inserting, and deleting nodes from the list. These methods manipulate the next and prev references to manage connections between nodes.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    public class ListNode {

    int item;
    ListNode next;
    ListNode prev;

    public ListNode(int item) {


    this.item = item;
    this.next = null;
    this.prev = null;
    }

    public ListNode(int item, ListNode next) {


    this.item = item;
    this.next = next;
    this.prev = null;
    }

    public ListNode(int item, ListNode next, ListNode prev) {


    this.item = item;
    this.next = next;
    this.prev = prev;
    }

    public void printNodeList() {

    ListNode tempNode = this;

    do {

    System.out.print(tempNode.item+" ");

    tempNode = tempNode.next;

    }while(tempNode!=null);

    System.out.println("");
    }

    public String getListNodeString() {

    String text = null;

    ListNode tempNode = this;

    do {

    if(text == null){
    text = Integer.toString(tempNode.item);
    }
    else {
    text = text +","+tempNode.item;
    }

    tempNode = tempNode.next;

    }while(tempNode!=null);
    return text;
    }

    public void insertAfter(int item) {


    ListNode newNode = new ListNode(item);

    if(this.next!=null) {
    this.next.prev = newNode;
    }

    newNode.next = this.next;
    this.next = newNode;

    newNode.prev = this;

    public void insertBefore(int item){


    ListNode newNode = new ListNode(item);

    newNode.prev = this.prev;

    if(this.prev!=null) {
    this.prev.next = newNode;
    }

    newNode.next = this;
    this.prev = newNode;
    }

    public void deleteAfter() {

    ListNode deleteNode = this.next;

    if(deleteNode != null) {
    this.next = deleteNode.next;

    if(deleteNode.next != null) {
    deleteNode.next.prev = this;
    deleteNode.next = null;
    deleteNode.prev = null;
    }

    }
    }

    public void deleteBefore() {


    ListNode deleteNode = this.prev;

    if(deleteNode!=null) {
    deleteNode.next = null;
    this.prev = deleteNode.prev;
    }

    if(deleteNode.prev != null) {
    deleteNode.prev.next = this;
    deleteNode.prev = null;
    }
    }

    public ListNode getNode(int index){


    if(index == 0) {
    return this;
    }
    else if(index<0 || this.next == null) {
    return null;
    }
    else {
    return this.next.getNode(index-1);
    }
    }

    You might also like