leetcode-106 从中序与后序遍历序列构造二叉树

106. 从中序与后序遍历序列构造二叉树

难度: 中等

---

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func buildTree(inorder []int, postorder []int) *TreeNode {

    postorderLen := len(postorder)
	if len(inorder) == 0 {
		return nil
	}
	root := &TreeNode{Val: postorder[postorderLen-1]}
	postorder = postorder[:postorderLen-1]
	for pos, node := range inorder {
		if node == root.Val {
			root.Left = buildTree(inorder[:pos], postorder[:len(inorder[:pos])])
			root.Right = buildTree(inorder[pos+1:], postorder[len(inorder[:pos]):])
		}
	}
	return root

}

文章目录

原文链接: https://dashen.tech/2015/03/01/leetcode-106-从中序与后序遍历序列构造二叉树/

版权声明: 转载请注明出处.