Package g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal

Class Solution

java.lang.Object
g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal.Solution
public class Solution extends Object
105 - Construct Binary Tree from Preorder and Inorder Traversal.<p>Medium</p> <p>Given two integer arrays <code>preorder</code> and <code>inorder</code> where <code>preorder</code> is the preorder traversal of a binary tree and <code>inorder</code> is the inorder 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> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]</p> <p><strong>Output:</strong> [3,9,20,null,null,15,7]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> preorder = [-1], inorder = [-1]</p> <p><strong>Output:</strong> [-1]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= preorder.length <= 3000</code></li> <li><code>inorder.length == preorder.length</code></li> <li><code>-3000 <= preorder[i], inorder[i] <= 3000</code></li> <li><code>preorder</code> and <code>inorder</code> consist of <strong>unique</strong> values.</li> <li>Each value of <code>inorder</code> also appears in <code>preorder</code>.</li> <li><code>preorder</code> is <strong>guaranteed</strong> to be the preorder traversal of the tree.</li> <li><code>inorder</code> is <strong>guaranteed</strong> to be the inorder traversal of the tree.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • get

      public int get(int key)

    • buildTree

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