vj1132 求二叉树的先序å&

Vj1132 求二叉树的先序å&

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//±ÉÈ˵ķ½·¨ //µÝ¹é / //×¢Òâ±ß½ç / var s1,s2:string; procedure calc(x,y:string); var k,l:integer; begin l:=length(x); write(y[l]); k:=pos(y[l],x); if k>1 then calc(copy(x,1,k-1),copy(y,1,k-1));
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2011 for the course CS 001 taught by Professor 001 during the Spring '11 term at Shandong University.

Ask a homework question - tutors are online