#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/divide-and-conquer/construct-binary-tree-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/divide-and-conquer/construct-binary-tree-implementation

Repovive

Construct Binary Tree - Implementation - Divide and Conquer | Fundamental Algorithms | Repovive

Repovive.

Fundamental Algorithms8 sections · 294 units2h total

Open in Course

Construct Binary Tree - Implementation

Here is the implementation:

function buildTree(preorder, inorder):
    inorderMap = map each value to its index in inorder
    return build(0, 0, inorder.length - 1)

function build(preStart, inStart, inEnd):
    if inStart > inEnd:
        return null

    rootVal = preorder[preStart]
    root = new TreeNode(rootVal)

    inRoot = inorderMap[rootVal]
    leftSize = inRoot - inStart

    root.left = build(preStart + 1, inStart, inRoot - 1)
    root.right = build(preStart + leftSize + 1, inRoot + 1, inEnd)

    return root

$O(n)$ time with hashmap, $O(n)$ space for the map and recursion stack.