From 042d798cb8c24843a6ecad2490591dcb7c81a2d3 Mon Sep 17 00:00:00 2001
From: aadil42 <77232799+aadil42@users.noreply.github.com>
Date: Sun, 23 Feb 2025 00:59:37 +0530
Subject: [PATCH] Create 1028-recover-a-tree-from-preorder-traversal.js

Solved 1028-recover-a-tree-from-preorder-traversal.js
---
 ...-recover-a-tree-from-preorder-traversal.js | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 javascript/1028-recover-a-tree-from-preorder-traversal.js

diff --git a/javascript/1028-recover-a-tree-from-preorder-traversal.js b/javascript/1028-recover-a-tree-from-preorder-traversal.js
new file mode 100644
index 000000000..5ae11654a
--- /dev/null
+++ b/javascript/1028-recover-a-tree-from-preorder-traversal.js
@@ -0,0 +1,58 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * PreOrderTraversal | DFS | Tree
+ * Time O(n) | Space O(n)
+ * https://leetcode.com/problems/recover-a-tree-from-preorder-traversal
+ * @param {string} traversal
+ * @return {TreeNode}
+ */
+var recoverFromPreorder = function(traversal) {
+    let i = 0;
+    const preOrderArr = [];
+    const depthArr = [];
+
+    while (i < traversal.length) {
+
+        const start = i;
+        if (traversal[i] === "-") {
+            while (i < traversal.length && traversal[i] === "-") {
+                i++;
+            }
+            depthArr.push(i-start);
+            continue;
+        }
+
+        while (i < traversal.length && traversal[i] !== "-") {
+            i++;
+        }
+        preOrderArr.push(+traversal.slice(start, i));
+    }
+
+    let idx = 0;
+    const dfs = (node, depth) => {
+        
+        node.val = preOrderArr[idx];
+
+        if (depth < depthArr[idx]) {
+            node.left = new TreeNode();
+            idx++;
+            dfs(node.left, depth+1);
+        }
+        if (depth < depthArr[idx]) {
+            node.right = new TreeNode();
+            idx++;
+            dfs(node.right, depth+1);
+        }
+    }
+
+    const root = new TreeNode();
+    dfs(root, 0);
+    return root;
+};