Implementación de JavaScript de una sola lista vinculada (LinkedList)
Bibliotecas relacionadas con NPMJS:
Lista compleja, lista inteligente, vinculada sola
Ideas de programación:
Su propia implementación:
Singlenode.js
(function () {"use estrict"; function node (element) {this.element = element; this.next = null;} módulo.exports = node;}) ();LinkedList.js
(function () {"use estrict"; var nodo = 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. function () {return this._size; LinkedList.Prototype.remove = Function (item) {if (item) {var prenode = this.findpre (item); function (item) {this.insert (item); Finder.Next = NewNode; return Currnode; nulo) return null;Implementación de JavaScript de DoubleLinkedList
Bibliotecas relacionadas con NPMJS:
Lista compleja e inteligente
Ideas de programación:
Su propia implementación
DoubleNode.js
(function () {"use estrict"; function node (element) {this.element = element; this.next = null; this.previous = null;} módulo.exports = node;}) ();DoubleLinkedList.js
(function () {"use Strict"; var node = request ("./ lib/doubleNode"); function doubleLinkedList () {this._head = new node ("this Is Head Node."); this._size = 0;} dooBlelinkedList.Prototype.gethead = function () {return this._head;};}; DoubleLinkedList.Prototype.isEmty = Function () {return this._size === 0; Currnode.next; (Node.Next === NULL) {Node.previous.Next = NULL; DoubleLinkedList.Prototype.Find = Function (item) {if (item == NULL) return null; = New Node (Newelement); NewNode;} this._size ++; DoubleLinkedList.Prototype.display = function () {var currnode = this.gethead ().