infix to prefix algorithm

Title Link: https://cn.vjudge.net/problem/POJ-2752Test instructionsGive a string the number of prefix strings with the same prefix string as the suffix stringExample: AlalaOutput: A, Ala, AlalaIdeasThink about it, the return value of Fail[len] is actually the maximum number of successful suffix strings.After getting this suffix string, the string smaller than this string must still be included in this new s

(!top->Left ) Top->left =NewNode; ElseTop->right =NewNode; } if(!num)//if it is an operator, change the current top node to point to the new node (operator) .{Stk.push (newnode); } } Else{Top=NewNode ();//if top is empty, meaning that the stack is empty, initialize theTop->data =C; Top->left =NULL; Top->right =NULL; Root= top;//Place root nodeStk.push (top); }} print_post (root); Delete_tree (root);//Recursive deletion}intMainintargcChar*argv[]) { Char*