正文

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

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

分享到:

;------------------------------------------------------------------------------------------------------------------------------------ midrr proc near start10:push ax           push dx           cmp byte ptr[si+2],0       jz exit3           push si       mov si,offset binary           add si,cx           add cx,3           call midr           pop si exit3: sub si,3           pop dx       pop ax       ret midrr endp ;---------------------------------------------------------------------------------------------------------------------------------------- lastr proc near start11:push ax             push dx         call lastrl         call lastrr         mov ax,0200h         mov dl,[si]         int 21h         sub si,3         pop dx         pop ax         ret lastr endp ;------------------------------------------------------------------------------------------------------------------------------------------- lastrl proc near start12:push ax           push dx           cmp byte ptr[si+1],0       jz exit4           push si      mov si,offset binary      add si,cx      add cx,3          call lastr      pop si exit4: pop dx           pop ax       ret lastrl endp ;-------------------------------------------------------------------------------------------------------------------------------------------- lastrr proc near start13:push ax           push dx           cmp byte ptr[si+2],0       jz exit5           push si       mov si,offset binary           add si,cx           add cx,3           call lastr           pop si exit5: pop dx       pop ax       ret lastrr endp end main

阅读(2799) | 评论(0)


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

评论

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