Build N-ary Tree from Balanced Parentheses | Dataford Interview Questions

Given a balanced-parentheses string, construct and return the root of an N-ary tree. Each matching () represents a node, and parentheses directly nested inside it represent its children.

Asked in the Coding round stage. Implement construct_tree(s), returning the tree as nested dictionaries in the form {"children": [...]}. Return None for an empty string.

Constraints

s contains only '(' and ')' characters
s is balanced
s represents zero or one top-level node
0 <= len(s) <= 2000

Function Signature

def construct_tree(s):

Your question is Build N-ary Tree from Balanced Parentheses. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a balanced-parentheses string, construct and return the root of an N-ary tree. Each matching () represents a node, and parentheses directly nested inside it represent its children.

Asked in the Coding round stage. Implement construct_tree(s), returning the tree as nested dictionaries in the form {"children": [...]}. Return None for an empty string.

Constraints

s contains only '(' and ')' characters
s is balanced
s represents zero or one top-level node
0 <= len(s) <= 2000

Function Signature

def construct_tree(s):

Your question is Build N-ary Tree from Balanced Parentheses. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.