算法 day3-线性数据结构的递归遍历

数组递归遍历

 var arr = [1,2,3,4,5,6,7,8]
       //递归遍历数组
       function bianArr(arr,i){
       //第一个参数是需要遍历的数组
       //第二个参数的从哪一位开始遍历
           if(arr == null || arr.length <= i) return;
           console.log(arr[i]);
           bianArr(arr,i+1)
       }
       bianArr(arr,0)

链表递归遍历

//递归遍历链表
  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){
      if(root == null) return;
      console.log(root.value);
      bianLink(root.next)
  }
  bianLink(node1)