Coding MRain , Beta!

program disk;
type	treetype=^temptype;
	temptype=record
		data:string;
		son,bro:treetype;
		end;
var	root,null:treetype;
	n:longint;
procedure tree_insert(var f,node:treetype);
begin
	if node^.data=f^.son^.data then
	begin
		dispose(node);
		node:=f^.son;
		exit;
	end;
	if node^.data<f^.son^.data then
	begin
		node^.bro:=f^.son;
		f^.son:=node;
		exit;
	end;
	f:=f^.son;
	while node^.data>f^.bro^.data do f:=f^.bro;
	if f^.bro^.data=node^.data then
	begin
		dispose(node);
		node:=f^.bro;
		exit;
	end;
	node^.bro:=f^.bro;
	f^.bro:=node;
end;
procedure deal(s:string);
var	t:string;
	now,tmp:treetype;
	k:integer;
begin
	now:=root;
	k:=pos(chr(92),s);
	while k>0 do
	begin
		t:=copy(s,1,k-1);
		tmp:=new(treetype);
		tmp^.data:=t;
		tmp^.son:=null;
		tmp^.bro:=null;
		tree_insert(now,tmp);
		now:=tmp;
		delete(s,1,k);
		k:=pos(chr(92),s);
	end;
	t:=s;
	tmp:=new(treetype);
	tmp^.data:=t;
	tmp^.son:=null;
	tmp^.bro:=null;
	tree_insert(now,tmp);
	now:=tmp;
end;
procedure init;
var	i:longint;
	t:string;
begin
	root:=new(treetype);
	null:=new(treetype);
	root^.data:='';
	null^.data:=chr(255);
	root^.son:=null;
	null^.son:=null;
	root^.bro:=null;
	null^.bro:=null;
	readln(n);
	for i:=1 to n do 
	begin
		readln(t);
		deal(t);
	end;
end;
procedure print(now:treetype;deep:integer);
var	i:longint;
begin
	if now=null then exit;
	for i:=1 to deep do
	begin
		write(' ');
	end;
	if deep<>-1 then writeln(now^.data);
	print(now^.son,deep+1);
	print(now^.bro,deep);
end;
begin
	assign(input,'disk.in');
	reset(input);
	assign(output,'disk.out');
	rewrite(output);
	init;
	print(root,-1);
	close(input);
	close(output);
end.