[说明]
完成以下中序线索化二叉树的算法。
[函数]
Typedef int datatype;
Typedef struct node {
Int ltag, rtag;
Datatype data;
*lchild,* rchild;
}bithptr;
bithptr pre;
void inthread ( p );
{if
{inthread ( p-＞lchild );
if ( p-＞lchild==unll ) ________ ;
if ( P-＞RCHILD=NULL) p-＞rtag=1;
if ________
{if ________ pre-＞rchild=p;
if ( p-＞1tag==1 ) ________ ;
}
INTHREAD ( P-＞RCHILD );
________ ;
}
}

填空题[说明]用输入 输出写一个程序，让用户输入一些姓名和电话号码。每一个姓名和号码将加在文件里。用户通过点“Done”按钮来告诉系统整个列表已输入完毕。 如果用户输入完整的列表，程序将创建一个输出文件并显示或打印出来。格式如：555，1212，Tom 123-456-7890，Peggy L.234-5678，Marc 234-5678，Ron 876-4321，Beth&Brian 33.1．42.45．70，Jean-Marc。[Java 代码]import java. io.*；class Phones{statlc FileOutputStream fos；public static final int lineLength =81；public static void main (String args []) throws IOExeption{byte [] phone=new byte [lineLength];byte [] name=new byte [lineLength]；int i；try{fos= new FileOutputStream ( phone. numbers )；}catch (FileNotFoundException e)while (true){________( Enter a name (enter done to quit) )；________(name)；if ( done . equalsIgnoteCase (new String (name,0，0，4))){break；}System.err.println ( Enter the phone number )；readLine (phone)；for (int i=0；phone [i]!=0；i++){________；}fos.write ( , )；for (int i=0________；i++){fos. write (name [i])；}fos. write ( n )；}fos. close()；}private static void readLine (byte line []) throws IOException{int i=0，b=0；while ((i＜________)&& ((b=System.in.read ())!= n )){line[i++] = ( byte ) b;}line[i]= ( byte ) 0;}}

填空题[说明]本程序求3～100之间的所有素数(质数)并统计个数；同时将这些素数从小到大依次写入顺序文件E: dataout.txt；素数的个数显示在窗体Form1上。[Visual Basic 代码]Private Sub Command1_ Click ( )Dim count as integer, flag as BooleanDim t1 as Integer, t2 as Integer________Count=0For t1=3 to 100Flag=TreeFor t2=2 to Int( Sqr ( t1 ) )If________Then flag=FalseNext t2________count=________write #1, t1End ifNext t1________Close #1End Sub