牛客题霸 NC12 重建二叉树

Posted 2021-09-04 Starzkg

https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6

解决方案

Go

func reConstructBinaryTree(pre []int, vin []int) *TreeNode {
	// write code here
	if len(pre) == 0 {
		return nil
	}
	pos := 0
	for ; pre[0] != vin[pos]; pos++ {
	}
	root := &TreeNode{
		Val:   pre[0],
		Left:  reConstructBinaryTree(pre[1:pos+1], vin[:pos]),
		Right: reConstructBinaryTree(pre[pos+1:], vin[pos+1:])}
	return root
}

参考文章