You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
38 lines
1.0 KiB
38 lines
1.0 KiB
// File: build_tree.go
|
|
// Created Time: 2023-07-20
|
|
// Author: hongyun-robot (1836017030@qq.com)
|
|
|
|
package chapter_divide_and_conquer
|
|
|
|
import . "github.com/krahets/hello-algo/pkg"
|
|
|
|
/* 构建二叉树：分治 */
|
|
func dfsBuildTree(preorder []int, inorderMap map[int]int, i, l, r int) *TreeNode {
|
|
// 子树区间为空时终止
|
|
if r-l < 0 {
|
|
return nil
|
|
}
|
|
// 初始化根节点
|
|
root := NewTreeNode(preorder[i])
|
|
// 查询 m ，从而划分左右子树
|
|
m := inorderMap[preorder[i]]
|
|
// 子问题：构建左子树
|
|
root.Left = dfsBuildTree(preorder, inorderMap, i+1, l, m-1)
|
|
// 子问题：构建右子树
|
|
root.Right = dfsBuildTree(preorder, inorderMap, i+1+m-l, m+1, r)
|
|
// 返回根节点
|
|
return root
|
|
}
|
|
|
|
/* 构建二叉树 */
|
|
func buildTree(preorder, inorder []int) *TreeNode {
|
|
// 初始化哈希表，存储 inorder 元素到索引的映射
|
|
inorderMap := make(map[int]int, len(inorder))
|
|
for i := 0; i < len(inorder); i++ {
|
|
inorderMap[inorder[i]] = i
|
|
}
|
|
|
|
root := dfsBuildTree(preorder, inorderMap, 0, 0, len(inorder)-1)
|
|
return root
|
|
}
|