Build Binary Tree from Preorder and Inorder Traversal
Build Binary Tree from Preorder and Inorder Traversal gives preorder and inorder arrays of unique values from the same tree and asks you to reconstruct that binary tree.
We'll cover the following...
Statement
Create a binary tree from two integer arrays, pOrder and iOrder, where pOrder represents a preorder traversal of a binary tree, and iOrder represents an inorder traversal of the same tree.
Constraints:
-
pOrder.length,iOrder.length iOrder.lengthpOrder.length-
pOrder[i],iOrder[i] pOrderandiOrderconsist of unique values.- Each value of
iOrderalso appears inpOrderand vice versa.
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to check if you’re solving the correct problem:
Build Binary Tree from Preorder and Inorder Traversal
Select the correct binary tree constructed from preorder and inorder traversal:
preorder = [1, 12, 15, 6, 9, 5, 2]
inorder = [15, 12, 6, 1, 5, 9, 2]
1
/ \
12 9
/ \ / \
15 6 5 2
12
/ \
1 9
/ \ / \
15 6 5 2
15
/ \
12 9
/ \ / \
1 6 5 2
9
/ \
1 12
/ \ / \
15 6 5 2
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground.
package mainimport (. "golang-test-code/ds_v1/BinaryTree") // TreeNode[T]// Definition of a binary tree node// type TreeNode[T any] struct {// Data T// Left *TreeNode[T]// Right *TreeNode[T]// }func buildTree(pOrder []int, iOrder []int) *TreeNode[int] {// Replace this placeholder return statement with your codereturn &TreeNode[int]{Data: -1}}