The Giving Tree Of Errors 3.0 You Are Given A Binary Tree Written As A Sequence Of Parent-Child Pairs. You Need To Detect Any Errors Which Prevent The Sequence From Being A Proper Binary Tree And Print The Highest Priority Error. If You Detect No Errors, Print Out The Lexicographically Smallest S-Expression For The Tree. . Input Format Input Is Read From