题目
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:你可以假设树中没有重复的元素。
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/
9 20
/
15 7
解题思路分析
1、递归;时间复杂度O(n),空间复杂度O(n)
func buildTree(inorder []int, postorder []int) *TreeNode {last := len(postorder) - 1for k := range inorder {if inorder[k] == postorder[last] {return &TreeNode{Val: postorder[last],Left: buildTree(inorder[0:k], postorder[0:k]),Right: buildTree(inorder[k+1:], postorder[k:last]),}}}return nil}
2、递归;时间复杂度O(n),空间复杂度O(n)
func buildTree(inorder []int, postorder []int) *TreeNode {if len(postorder) == 0 {return nil}return helper(inorder, postorder)}func helper(inorder []int, postorder []int) *TreeNode {var root *TreeNodelast := len(postorder) - 1for k := range inorder {if inorder[k] == postorder[last] {root = &TreeNode{Val: postorder[last]}root.Left = helper(inorder[0:k], postorder[0:k])root.Right = helper(inorder[k+1:], postorder[k:last])}}return root}
3、迭代;时间复杂度O(n),空间复杂度O(n)
func buildTree(inorder []int, postorder []int) *TreeNode {if postorder == nil || len(postorder) == 0 {return nil}last := len(postorder) - 1root := &TreeNode{Val: postorder[last],}length := len(postorder)stack := make([]*TreeNode, 0)stack = append(stack, root)index := lastfor i := length - 2; i >= 0; i-- {value := postorder[i]node := stack[len(stack)-1]if node.Val != inorder[index] {node.Right = &TreeNode{Val: value}stack = append(stack, node.Right)} else {for len(stack) > 0 && stack[len(stack)-1].Val == inorder[index] {node = stack[len(stack)-1]stack = stack[:len(stack)-1]index--}node.Left = &TreeNode{Val: value}stack = append(stack, node.Left)}}return root}
总结
Medium题目,考察二叉树知识点,其中本题递归的方法比较好理解,迭代方法稍微难理解一点
解题思路同leetcode105 从前序与中序遍历序列构造二叉树