OJ Board

Please somebody check it. I know it works but i received WA

Program ACM10701;
Type
BTree = ^Node;
Node = record
value : Char;
L,R : BTree;
end;
Traversal = String[54];

Var
Preorder,Inorder,Postorder : Traversal;
A : BTree;
C,N,i,j,k:integer;
V:Char;

Procedure MakeTree(var P:BTree ...

Here you are my PASCAL code for 10701 problem. What I do is to build the tree and then traverse it in PostOrder. I think it works but... WA... Does anybody could help me, please???

Sincerelly yours Hector

Program ACM10701;
Type
BTree = ^Node;
Node = record
value : Char;
L,R : BTree;
end ...

I think this code works but .. i get WA. Could anybody check it, please?

Program ACM465;
var
I,D : LongInt;
p,pm,pp,pei,ped:integer;
S,SI,SD : String;
b:boolean;
Begin
while not eof do
begin
readln( S );
pm:=pos('+',S); pp:=pos('*',S); b:=FALSE;
p:=pm+pp;
if p=0 then continue;
SI ...

I think this solution work but I received WRONG ANSWER. I would like anybody review this code in order to get the bugs because I can