Package g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal

Class Solution

java.lang.Object
g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal.Solution
public class Solution extends Object
1008 - Construct Binary Search Tree from Preorder Traversal.<p>Medium</p> <p>Given an array of integers preorder, which represents the <strong>preorder traversal</strong> of a BST (i.e., <strong>binary search tree</strong> ), construct the tree and return <em>its root</em>.</p> <p>It is <strong>guaranteed</strong> that there is always possible to find a binary search tree with the given requirements for the given test cases.</p> <p>A <strong>binary search tree</strong> is a binary tree where for every node, any descendant of <code>Node.left</code> has a value <strong>strictly less than</strong> <code>Node.val</code>, and any descendant of <code>Node.right</code> has a value <strong>strictly greater than</strong> <code>Node.val</code>.</p> <p>A <strong>preorder traversal</strong> of a binary tree displays the value of the node first, then traverses <code>Node.left</code>, then traverses <code>Node.right</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/03/06/1266.png" alt="" /></p> <p><strong>Input:</strong> preorder = [8,5,1,7,10,12]</p> <p><strong>Output:</strong> [8,5,10,1,7,null,12]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> preorder = [1,3]</p> <p><strong>Output:</strong> [1,null,3]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= preorder.length <= 100</code></li> <li><code>1 <= preorder[i] <= 1000</code></li> <li>All the values of <code>preorder</code> are <strong>unique</strong>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • bstFromPreorder

      public TreeNode bstFromPreorder(int[] preorder)