We perform a preorder depth-first traversal on a binary tree starting from its root.

• For each node, we first write D dashes, where D is the depth of the node in the tree, followed by the node’s integer value.

• The root node has depth 0.

• If a node is at depth D, its children (if any) will appear at depth D + 1.

• If a node has only one child, it will always be the left child.

You are given the string representation of this traversal. Your task is to reconstruct the original binary tree and return its root.

Constraints:

• The number of nodes in the original binary tree lies within the range $[1, 500]$.

• $1 \leq$ node.data $\leq 10^3$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.