阅读以下说明和C语言函数，将应填入（n)处的字句写在对应栏内。[说明] 完成以下中序线索化二叉树的

阅读以下说明和C语言函数，将应填入(n)处的字句写在对应栏内。[说明]完成以下中序线索化二叉树的算法。[函数]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 ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

[说明]完成以下中序线索化二叉树的算法。[函数]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 ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

完成以下中序线索化二叉树的算法。[函数]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 ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

[函数]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 ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

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 ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

Typedef struct node {Int ltag, rtag;Datatype data;*lchild,* rchild;}bithptr;bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

Int ltag, rtag;Datatype data;*lchild,* rchild;}bithptr;bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

Datatype data;*lchild,* rchild;}bithptr;bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

*lchild,* rchild;}bithptr;bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

}bithptr;bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

bithptr pre;void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

void inthread (p );{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

{if{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

{inthread (p-＞lchild );if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

if (p-＞lchild==unll ) (1);if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

if (P-＞RCHILD=NULL) p-＞rtag=1;if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

if (2){if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

{if (3) pre-＞rchild=p;if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

if (p-＞1tag==1 )(4);}INTHREAD (P-＞RCHILD );(5);}}

}INTHREAD (P-＞RCHILD );(5);}}

INTHREAD (P-＞RCHILD );(5);}}

(5);}}

}}

}