正文

汇编语言实现二叉树的存储和遍历(四)2005-08-17 17:12:00

【评论】 【打印】 【字体: 】 本文链接:http://blog.pfan.cn/hofy/3882.html

分享到:

prompt proc near                    ;give the  prompt information start5:push ax          push dx          mov ax,0900h          mov dx,offset hey2          int 21h                   mov ax,0200h          mov dl,[si]          int 21h                   mov ax,0900h          mov dx,bx          int 21h          pop dx          pop ax          ret prompt endp ;--------------------------------------------------------------------------------------------------------------------------------------------- firstr proc near                             ;the traversing of first root           push ax           push dx           mov dx,offset hey5           mov ax,0900h           int 21h                    mov si,offset binary start6:mov dl,[si]           mov ax,0200h           int 21h           add si,3           cmp byte ptr[si],0           jz re           jmp start6 re:     pop dx           pop ax           ret firstr endp ;-------------------------------------------------------------------------------------------------------------------------------------------- midr proc near start7:push ax           push dx       call midrl       mov ax,0200h       mov dl,[si]       int 21h      call midrr          pop dx       pop ax       ret midr endp ;----------------------------------------------------------------------------------------------------------------------------------------- midrl proc near start9:push ax           push dx           cmp byte ptr[si+1],0       jz exit2           push si      mov si,offset binary      add si,cx      add cx,3          call midr      pop si exit2: pop dx           pop ax       ret midrl endp

阅读(2979) | 评论(0)


版权声明:编程爱好者网站为此博客服务提供商,如本文牵涉到版权问题,编程爱好者网站不承担相关责任,如有版权问题请直接与本文作者联系解决。谢谢!

评论

暂无评论
您需要登录后才能评论,请 登录 或者 注册