BLACK FRIDAY: Up to 35% off Premium

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Low Level Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 536. Construct Binary Tree from String

Reconstruct a binary tree from its preorder string representation where node values are integers and left/right children are given as parenthesized substrings (e.g., "4(2(3)(1))(6(5))"); parse nested parentheses and multi-digit/negative numbers and attach subtrees appropriately using recursion or a stack.

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early August, 2025

Meta

Senior

You need to construct a binary tree from a string consisting of parenthesis and integers.

Late March, 2025

Meta

Senior

Late February, 2025

Meta

Staff

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 536. Construct Binary Tree from String

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact