Sicily 1156 Binary Tree

Binary Tree input in the forward direction

#include 
  
    # include 
   
     using namespace STD; struct node {char content; int left; int rigoal;}; node tree [1001]; void pre_print (node); int main () {bool isroot [1001]; // record whether the root node int ID [1001]; // node number INT cases, N, left, Right, K; char C; while (CIN> Cases) {memset (isroot, true, sizeof (isroot); k = 0; For (INT I = 0; I 
    
      N> C> left> right; tree [N]. left = left; tree [N]. rigoal = right; tree [N]. content = C; isroot [left] = isroot [right] = false; // neither the left son nor the right son is the root node ID [k ++] = N ;} // find the root node for (INT I = 0; I