Construct String from Binary Tree

Given a binary tree root, produce a string from a preorder traversal where each node is its value followed by its children in parentheses; omit empty "()" pairs except you must include "()" for a missing left child when a right child exists to preserve structure. This is a tree traversal and string-construction problem that requires careful handling of parentheses to reflect absent children.