Given a string representation of a binary tree, write a function to parse the string and construct the tree. Then, identify and return a list of errors found in the tree, such as nodes with more than two children, more than one root, or duplicate parent-child pairs.