Week 13

// function recursiveBinarySearch(a,t){



//     let l=0, r= a.length-1
//     m= Math.floor( (l+r)/2 )

//     if(a[m]===t){
//         return m
//     }

//     if(t<a[m]){

//         return recursiveBinarySearch(a,t)
//     }else{
//         return recursiveBinarySearch(a,t)
//     }

// }

// console.log(recursiveBinarySearch([1,2,3,4,5],6));

class Node{
    constructor(val){
        this.val=val
        this.next= null
        this.prev=null
    }
}

class LinkedList{
    constructor() {
        this.head=null
        this.tail=null
        this.size=0
    }

    prepend(val){
        let node= new Node(val)
        if(this.size){
            node.next=this.head
            this.tail.next=node
        }else{
            this.tail=node
        }
        this.head=node
        this.size++
    }

}