#1350, #1351 leetcode problems 000889-construct-binary-tree-from-preorder-and-postorder-traversal submissions 1552937068

Co-authored-by: kovatz <[email protected]>
Co-authored-by: topugit <[email protected]>
Co-authored-by: basharul-siddike <[email protected]>
Co-authored-by: hafijul233 <[email protected]>

Author: 5 people

algorithms/000889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md

@@ -69,29 +69,12 @@ class TreeNode {
  * @return TreeNode
  */
 function constructFromPrePost($preorder, $postorder) {
-    if (empty($preorder)) {
-        return null;
-    }
-    $rootVal = $preorder[0];
-    $root = new TreeNode($rootVal);
-    $n = count($preorder);
-    if ($n == 1) {
-        return $root;
-    }
-    $leftVal = $preorder[1];
-    $leftPostIdx = array_search($leftVal, $postorder);
-    $leftSize = $leftPostIdx + 1;
-
-    $leftPre = array_slice($preorder, 1, $leftSize);
-    $leftPost = array_slice($postorder, 0, $leftSize);
-
-    $rightPre = array_slice($preorder, $leftSize + 1);
-    $rightPost = array_slice($postorder, $leftSize, $n - $leftSize - 1);
-
-    $root->left = constructFromPrePost($leftPre, $leftPost);
-    $root->right = constructFromPrePost($rightPre, $rightPost);
-
-    return $root;
+    ...
+    ...
+    ...
+    /**
+     * go to ./solution.php
+     */
 }
 
 // Helper function to print tree in level-order