【算法】js创建简单链表、遍历链表

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

let node1 = new Node(1);
let node2 = new Node(2);
let node3 = new Node(3);

node1.next = node2;
node2.next = node3;
node3.next = null;

// 循环遍历
function loop(node) {
    let temp = node;
    while(true) {
        if(temp != null) {
            console.log(temp.value)
        }else break;
        temp = temp.next;
    }
}

// 递归遍历，必须有return
function recursion(node) {
    if(node == null) return;
    console.log(node.value);
    recursion(node.next)
}