The Marking Scheme for Assignment #2 Part A: Total 50 points broken down into 10 points for clean compilation (if not compiled, mark of strict 0 unless it was a very simple reason) 10 points for clearly written program with constructive comments 20 points for "CORRECT" outputs on test cases 10 points for GOOD-looking trees ;) Remarks: Use of any unsupported c functions in your program will result in mark of zero. Your program must be compiled on the departmental linux environ. in order to get a full credit. Good-looking trees refer to ones with evenly-spreaded nodes well allocated on screen. Any jammed nodes or duplicated edge structures upon inputs of complex algebraic expressions are exempt from the good-looking trees.