先序和中序生成二叉树(js)

最新推荐文章于 2022-07-29 10:41:45 发布

旭氏美术馆

最新推荐文章于 2022-07-29 10:41:45 发布

阅读量583

点赞数

分类专栏： leetcode 文章标签：数据结构二叉树先序遍历中序遍历构造二叉树

本文链接：https://blog.csdn.net/ChenXvYuan_001/article/details/102757475

版权

leetcode 专栏收录该内容

0 篇文章 0 订阅

订阅专栏

先序和中序生成二叉树js代码：

function TreeNode(val) {
    this.val = val;
    this.left = this.right = null;
  }

/**
 * @param {number[]} preorder
 * @param {number[]} inorder
 * @return {TreeNode}
 */
var buildTree = function(preorder, inorder) {  
    var root
    if(preorder.length===0){//preorder和inorder为null的情况
         root=null
    }else{
        root=new TreeNode(preorder[0])
        let indRoot=inorder.indexOf(preorder[0])    
        let inleft=inorder.slice(0,indRoot),inright=inorder.slice(indRoot+1)
        let preleft=preorder.slice(1,1+inleft.length),preright=preorder.slice(1+inleft.length)
        travel(root,inleft,inright,preleft,preright)
    }

    return root
};

function travel(tree,inleftTree,inrightTree,preleft,preright){
    if(inleftTree.length===0){
      tree.left=null
    }else{
        tree.left=new TreeNode(preleft[0])     
        let indRoot=inleftTree.indexOf(preleft[0])
        let inleft=inleftTree.slice(0,indRoot),inright=inleftTree.slice(indRoot+1)
        let pleft=preleft.slice(1,1+inleft.length),pright=preleft.slice(1+inleft.length,preleft.length)
        travel(tree.left,inleft,inright,pleft,pright)
    }
    
     if(inrightTree.length===0){
       tree.right=null
    }else{        
        tree.right=new TreeNode(preright[0])
        let indRoot=inrightTree.indexOf(preright[0])       
        let inleft=inrightTree.slice(0,indRoot),inright=inrightTree.slice(indRoot+1,inrightTree.length)
        let pleft=preright.slice(1,1+inleft.length),pright=preright.slice(1+inleft.length,preright.length)        
        travel(tree.right,inleft,inright,pleft,pright)
    }
}