LL

linkedlist.js

/*
add,remove,length, reverse
{value,next}
*/
class List{
	constructor(){
	}
}

class Node{
	constructor(name, next=null){
		this.name = String(name);
		this.next = next;
	}
}

class LL{
	constructor(){
		this.head = null;
	}
	add(name=''){
		let node = this.head;
		while(node && node.next){
			node = node.next;
		};
		if(!node){
			this.head = new Node(name);
		}else{
			node.next = new Node(name);
		}
	}
	remove(name=''){
		let node = this.head;
		let parent;
		while(node){
			if(node.name === name){
				
			}
			node = 
		};
	}
	reverse(){
	}
	get length(){
	}
	toArray(){
		const list = [];
		let next = this;
		do{
			list.push(next);
			next = next.next;
		}while(next);
		return list;
	}
	toString(){
		return this.name;
		//return `name: ${ this.name }, next: ${ this.next }`;
	}
	string(joiner=', '){
		const list = this.toArray();
		return list.join(joiner);
	}
	print(joiner){
		return console.log(this.string(joiner));
	}
}


var list = [];
console.log(list.print(''));
console.log(list.length);
console.log(list.reverse());
console.log(list.remove('I'));