데이터 구조 노트

  



var queue = []

function    (name){
    let number = Math.round(Math.random() * 10000)
    queue.push(number)
    //output.textContent =       ${number},
    //     ${queue.length -1}  
    return number
}
function   (){
    //if(queue.length === 0){
    return
    }
    let theNumber = queue.shift()
    screenDiv.textContent = '  ${theNumber}     '
    retun theNumber
}

//takeNumber.onclick = function(){
      ()
}
//setInterval(function(){
      ()
},3000)

栈(stack):先进后出

  
  



var    = []

function   (name){
      .push(name)
    output.textContent = name + '     '
    return
}

function   (){
    if(   .length === 0)
    output.textContent = '  '
    return
}
var theBook =   .pop()
    output.textContent = theBook + '   '
    return theBook
}

button1.onclick = function(){
      (Math.random())
}
button2.onclick = function(){
      ()
}

Hash 哈希（表）

给我一个东西我给你另外一个东西

(1)用Hash找出字母出现的次数(已知参数的情况下)

var string = "I am Frank,I am 18 years old"

var hash = {}

for(var i = 0;i

function sort(string){
var str={};
for(var i=0;i

var array = [2,11,3,12,4,5,12]

var hash = []//        
// hash
for(var i = 0; i

function bucketsort(array){
    var buckets=[];
    var result = [];
    for(var i=0;i

var root = {
    name:'  ',
    children:[]
}

function addChild(parent,child){
    parent.children.push(child)
}
addChild(root,{
    name:'  ',
    children:[]
})

addChild(root,{
    name:'  ',
    children:[]
})

addChild(root.children[0],{
    name:'    ',
    children:[]
})
addChild(root.children[0],{
    name:'    ',
    children:[]
})
addChild(root.children[0],{
    name:'    ',
    children:[]
})
addChild(root.children[1],{
    name:'  ',
    children:[]
})
addChild(root.children[1],{
    name:'  ',
    children:[]
})

console.log(root)

function travelTree(node){
    console.log(node.name)
    for(var i= 0; i