Package g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal

Class Solution

java.lang.Object

g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal.Solution

public class Solution
extends Object

106 - Construct Binary Tree from Inorder and Postorder Traversal.<p>Medium</p> <p>Given two integer arrays <code>inorder</code> and <code>postorder</code> where <code>inorder</code> is the inorder traversal of a binary tree and <code>postorder</code> is the postorder traversal of the same tree, construct and return <em>the binary tree</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/19/tree.jpg" alt="" /></p> <p><strong>Input:</strong> inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]</p> <p><strong>Output:</strong> [3,9,20,null,null,15,7]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> inorder = [-1], postorder = [-1]</p> <p><strong>Output:</strong> [-1]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= inorder.length <= 3000</code></li> <li><code>postorder.length == inorder.length</code></li> <li><code>-3000 <= inorder[i], postorder[i] <= 3000</code></li> <li><code>inorder</code> and <code>postorder</code> consist of <strong>unique</strong> values.</li> <li>Each value of <code>postorder</code> also appears in <code>inorder</code>.</li> <li><code>inorder</code> is <strong>guaranteed</strong> to be the inorder traversal of the tree.</li> <li><code>postorder</code> is <strong>guaranteed</strong> to be the postorder traversal of the tree.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
TreeNode	buildTree(int[] inorder, int[] postorder)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

buildTree

public TreeNode buildTree(int[] inorder,
 int[] postorder)