Leetcode Problem 536. Construct Binary Tree from String

536. Construct Binary Tree from String

Leetcode Solutions

Define a recursive function str2treeInternal that takes the string and the current index as arguments.
If the current index is at the end of the string, return None and the current index.
Use a helper function getNumber to parse the integer value and update the index.
Create a new tree node with the parsed integer value.
If the next character is an opening parenthesis, recursively construct the left subtree.
If another opening parenthesis follows, recursively construct the right subtree.
After constructing both subtrees, if the next character is a closing parenthesis, increment the index.
Return the constructed tree node and the updated index.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen