software developer

rite a function that parses an input string that contains the representation of the nodes of a binary tree in the form "(a, b) (c, d), ..." where each

pair represents a node. The first value in the pair is the parent of the node, and the second value is the value stored at this node. The function should

handle any errors with the input or the tree including improper input format, too many child nodes, and cycles within the tree. If there are no errors, the

function should cycle through the tree and print the values of the node in order.