实验作业2-1
2021-10-24 23:57:04 0 举报作业
作者其他创作
大纲/内容
while(top)
no
stack[top++]=head
stack[top++]=head.rcstack[top++]=headstack[top++]=head.lc
end
print(stack[top])head=stack[top]top--
head=stack[top]top--
stack[top++]=headstack[top++]=head.rcstack[top++]=head.lc
visited[head]=1
if(first[i]==mid[j])beg=j+1end=j-1
last_print(tree)
input(first)inputt(mid)
print(head)
mid_print(tree)
开始
i=1.i<=nj=beg;j<=end
if(beg<end)
if(visited[head])
yes
stack[]top=0visited
stack[top++]=head.rcstack[top++]=head.lc
first_print(tree)
stack[]top=0
0 条评论
下一页
