算法 day2-线性数据结构的遍历

数组的遍历

var arr = [1,2,3,4,5,6,7,8]
function bianArr(arr){
           if(arr == null) return; 算法题必须加上  否则报错什么都不算
           for(var i = 0;i<arr.length;i++){
               console.log(arr[i]);
           }
       }
 bianArr(arr)

链表的遍历

 function Node(value){
           this.value = value;
           this.next = null;
       }
      var node1 = new Node(1)
       var node2 = new Node(2)
       var node3 = new Node(3)
       var node4 = new Node(4)
       var node5 = new Node(5)
       node1.next = node2
       node2.next = node3
       node3.next = node4
       node4.next = node5
       function bianLink(root){
           var temp = root
           while(true){
               if(temp != null){
                   console.log(temp.value);
               }else{
                   break;
               }
               temp = temp.next
           }
       }
       bianLink(node1)