/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2015 CodeRevisited.com
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 *
 */

package com.coderevisited.linkedlists.singly;

public class SinglyLinkedListNode
{

    private int value;
    private SinglyLinkedListNode next;

    public SinglyLinkedListNode(int value, SinglyLinkedListNode next)
    {
        this.value = value;
        this.next = next;
    }

    public SinglyLinkedListNode getNext()
    {
        return next;
    }

    public int getValue()
    {
        return value;
    }

    public void setNext(SinglyLinkedListNode next)
    {
        this.next = next;
    }
}

@@ -1656,11 +1656,84 @@
 t;%0A    %7D
+%0A%0A    public void setValue(int value) %7B%0A        this.value = value;%0A    %7D
 %0A%7D%0A

Delete Arbitrary Node in Linked list