Recover a Tree From Preorder Traversal

Statement

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 ...