Page Title

JS Data Structures

Stack

Stack is an array that has only access to the last element and this element can be popped away or a new one pushed in.

class Stack{
 constructor(){
   this.get = Array.from(arguments)
   }
   push(el) {
    return this.get.push(el)
  }
  pop() {
 return this.get.pop()
 }
}
st = new Stack(0,1,2,3)
st.pop() // [0,1,2]
st.push(4) // [0,1,2,4]
alert(st.get)

Queue

Queue is an array where one element comes into it and another goes away.

class Queue {
constructor() {
  this.get = Array.from(arguments)
  }
  add(el) {
     return this.get.unshift(el)
 }
 pop(el) {
     return this.get.pop(el)
  }
}
qu = new Queue(0,1,2,3)
qu.add(4) // [4,0,1,2,3]
qu.pop() // [4,0,1,2]
alert(qu.get)

Linked list

class Block {
    constructor(val, link) {
this.val = val
this.link = link
    }
}
List = new Block(5, new Block(6))
alert(stringify(List.link))

Hash table

Hash table is a set of elements which are sorted by special algorithm.

/*
It would be better to import
CryptoJS but it is only in
backend JS
*/
const hashGen = (val,min,max) => (
    Math.random()*(max-min)+min
)

class HashBlock {
   constructor(val) {
 this.val = val
 this.num = hashGen(this.val,2,10)
     }
}
a = new HashBlock('Hello')
alert(a.num)

Click '^' to support me :3

JS Data Structures V2