原由

近来在看《数据结构与算法–javascript形貌》，然后上npmjs.org去搜刮，想找适宜的库参考并记录下来，以备今后用时能拿来即用，最没有发明很合本身意的，于是就决议本身逐一完成出来。

npmjs相干库

complex-list、smart-list、singly-linked-list

编程思绪

add要领用于将元素追加到链表尾部，借由insert要领来完成；
注重各个函数的边界条件处置惩罚。

本身的完成

SingleNode.js

(function(){
    "use strict";

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

    module.exports = Node;
})();

LinkedList.js

(function(){
    "use strict";

    var Node = require("./lib/SingleNode");

    function LinkedList(){
        this._head = new Node("This is Head Node.");
        this._size = 0;
    }

    LinkedList.prototype.isEmpty =  function(){
        return this._size === 0;
    };

    LinkedList.prototype.size =  function(){
        return this._size;
    };

    LinkedList.prototype.getHead = function(){
        return this._head;
    };

    LinkedList.prototype.display = function(){
        var currNode = this.getHead().next;
        while(currNode){
            console.log(currNode.element);
            currNode = currNode.next;
        }
    };

    LinkedList.prototype.remove = function(item){
        if(item) {
            var preNode = this.findPre(item);
            if(preNode == null)
                return ;
            if (preNode.next !== null) {
                preNode.next = preNode.next.next;
                this._size--;
            }
        }
    };

    LinkedList.prototype.add = function(item){
        this.insert(item);
    };

    LinkedList.prototype.insert = function(newElement, item){
        var newNode = new Node(newElement);
        var finder = item ? this.find(item) : null;
        if(!finder){
            var last = this.findLast();
            last.next = newNode;
        }
        else{
            newNode.next = finder.next;
            finder.next = newNode;
        }
        this._size++;
    };

    /*********************** Utility Functions ********************************/

    LinkedList.prototype.findLast = function(){
        var currNode = this.getHead();
        while(currNode.next){
            currNode = currNode.next;
        }
        return currNode;
    };

    LinkedList.prototype.findPre = function(item){
        var currNode = this.getHead();
        while(currNode.next !== null && currNode.next.element !== item){
            currNode = currNode.next;
        }
        return currNode;
    };

    LinkedList.prototype.find = function(item){
        if(item == null)
            return null;
        var currNode = this.getHead();
        while(currNode && currNode.element !== item){
            currNode = currNode.next;
        }
        return currNode;
    };

    module.exports = LinkedList;
})();

源代码地点

https://github.com/zhoutk/js-data-struct
http://git.oschina.net/zhoutk/jsDataStructs