链表的逆置

function Node(value){
    this.value = value;
    this.next = null;
}

var node1 = new Node(1);
var node2 = new Node(2);
var node3 = new Node(3);
var node4 = new Node(4);
var node5 = new Node(5);


node1.next = node2;
node2.next = node3;
node3.next = node4;
node4.next = node5;


function nizhi(root){
    if(root.next.next == null){ //倒数第二个
        root.next.next = root;  //让最后一个节点指向自己
        return root.next;
    }else{
        var res = nizhi(root.next);
        root.next.next = root;
        root.next = null;
        return res;
    }
}

bianlink(node1);

var root = nizhi(node1);

function bianlink(root){
    if(root == null) {
        return;
    }
    console.log(root.value);
    bianlink(root.next);
}


bianlink(root);