javascript数据结构之链表

最新推荐文章于 2024-04-19 13:37:25 发布

计算机技术之指尖密码

最新推荐文章于 2024-04-19 13:37:25 发布

阅读量77

点赞数

分类专栏： javascript数据结构

本文链接：https://blog.csdn.net/w1374401940/article/details/105000911

版权

javascript数据结构专栏收录该内容

30 篇文章 0 订阅

订阅专栏

单链表

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

function LinkList() {
    this.root=null;
    this.find=find;
    this.insert=insert;
    this.display=display;
}

function find(element) {
    let node=this.root;
    while(node!=null){
        if(node.element==element)
            return node;
        else
            node=node.next;
    }
    return  null;
}

function insert(node) {
    if(this.root==null)
        this.root=node;
    else{
        let currrent=this.root;
        while (currrent.next!=null){
            currrent=currrent.next;
        }
        currrent.next=node;
    }
}


function display() {
    let node =this.root;
    while (node!=null){
        console.log(node.element);
        node=node.next;
    }
}


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

let linklist=new LinkList();
linklist.insert(node1);
linklist.insert(node2);
linklist.insert(node3);
linklist.display();

双链表

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

function LinkList() {
    this.root=null;
    this.find=find;
    this.insert=insert;
    this.display=display;
}

function display() {
    let current=this.root;
    while (current!=null){
        console.log(current.element);
        current=current.next;
    }
}

function find(element) {
    let current=this.root;
    while (current!=null){
       if(current.element==element)
           return current;
       else
            current=current.next;
    }
    return null;
}

function insert(node) {
    if(this.root==null)
        this.root=node;
    else{
        let current=this.root;
        while (current.next!=null){
            current=current.next;
        }
        current.next=node;
        node.previous=current;

    }
}

let node1=new Node(3);
let node2=new Node(5);
let node3=new Node(4);

let linklist=new LinkList();
linklist.insert(node1);
linklist.insert(node2);
linklist.insert(node3);
linklist.display();