Binary treesort
 

tree := nil;
for i:=1 to n do insert( tree, );
output_infix( tree );



tree := nil;
for i:=1 to n do insert( tree, );
output_infix( tree );

(c) Shilpa Sayura Foundation 2006-2017