From 3610649f6407bc330e749d5ee45b543f246048fd Mon Sep 17 00:00:00 2001
From: MD ARIFUL HAQUE <mah.shamim@gmail.com>
Date: Sun, 23 Feb 2025 22:05:23 +0600
Subject: [PATCH] #1350, #1351 leetcode problems
 000889-construct-binary-tree-from-preorder-and-postorder-traversal
 submissions 1552937068

Co-authored-by: kovatz <kovatz.it@gmail.com>
Co-authored-by: topugit <topu119@hotmail.com>
Co-authored-by: basharul-siddike <basharulsiddike@gmail.com>
Co-authored-by: hafijul233 <hafijul233@gmail.com>
---
 .../README.md                                 | 29 ++++---------------
 1 file changed, 6 insertions(+), 23 deletions(-)

diff --git a/algorithms/000889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md b/algorithms/000889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md
index 28e5ca281..567912492 100644
--- a/algorithms/000889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md
+++ b/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