package main

import "leetcode-golang/entity"

func buildTree(preorder []int, inorder []int) *entity.TreeNode {

	if len(preorder) == 0 {
		return nil
	}
	root := &entity.TreeNode{
		Val: preorder[0],
	}
	i := 0
	for ; i < len(inorder); i++ {
		if inorder[i] == preorder[0] {
			break
		}
	}
	root.Left = buildTree(preorder[1:len(inorder[:i])+1], inorder[:i])
	root.Right = buildTree(preorder[len(inorder[:i])+1:], inorder[i+1:])
	return root

}