汇编语言实现二叉树的存储和遍历

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

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