摘要：起因最近在看數(shù)據(jù)結(jié)構(gòu)與算法描述，然后上去搜索，想找合適的庫(kù)參考并記錄下來(lái)，以備以后用時(shí)能拿來(lái)即用，最沒(méi)有發(fā)現(xiàn)很合自己意的，于是就決定自己一一實(shí)現(xiàn)出來(lái)。自己的實(shí)現(xiàn)源代碼地址

最近在看《數(shù)據(jù)結(jié)構(gòu)與算法--javascript描述》，然后上npmjs.org去搜索，想找合適的庫(kù)參考并記錄下來(lái)，以備以后用時(shí)能拿來(lái)即用，最沒(méi)有發(fā)現(xiàn)很合自己意的，于是就決定自己一一實(shí)現(xiàn)出來(lái)。

complex-list、smart-list

雙鏈表多了一個(gè)指向前趨的指針，故單鏈表中的輔助函數(shù)findPre就不需要了；
增加了反向輸出方法；
注意邊界條件的處理。

DoubleNode.js

(function(){
    "use strict";

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

    module.exports = Node;
})();

DoubleLinkedList.js

(function(){
    "use strict";
    var Node = require("./lib/DoubleNode");

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

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

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

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

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

    DoubleLinkedList.prototype.add = function(item){
        if(item == null)
            return null;
        this.insert(item);
    };

    DoubleLinkedList.prototype.remove = function(item){
        if(item) {
            var node = this.find(item);
            if(node == null)
                return ;
            if (node.next === null) {
                node.previous.next = null;
                node.previous = null;
            } else{
                node.previous.next = node.next;
                node.next.previous = node.previous;
                node.next = null;
                node.previous = null;
            }
            this._size--;
        }
    };

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

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

    DoubleLinkedList.prototype.dispReverse = function(){
        var currNode = this.findLast();
        while(currNode != this.getHead()){
            console.log(currNode.element);
            currNode = currNode.previous;
        }
    };

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

    module.exports = DoubleLinkedList;
})();

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