Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 30
Level: HardYou’re given a preorder DFS of a binary tree encoded as a string.
For each node, the encoding writes D dashes (where D is the node’s depth, with root depth 0) followed by the node’s integer value. If a node has only one child, it’s guaranteed to be the left child.
Reconstruct the binary tree and return its root.
Input: traversal = "1-2--3--4-5--6--7"
Output: [1,2,5,3,4,6,7]
Input: traversal = "1-2--3---4-5--6---7"
Output: [1,2,5,3,null,6,null,4,null,7]
Input: traversal = "1-401--349---90--88"
Output: [1,401,null,349,88,90]
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result