; Binary Tree Search Program for VISUAL$2$

; Input:

; R$0-$ Value to search

; R$1-$ Pointer to the tree root $(0$x$200)$

; Output:

; R$1-$ Address of the value if found, $0$ if not found

start:

; Load the value to search

LD R$2,$ R$0,$ #$0$ ; R$2$ now holds the value to search

; Check if the tree root is null $($empty tree$)$

CMP R$1,$ #$0$

BEQ not$\_$found ; If root is null, go to not$\_$found

search$\_$loop:

; Load the current node's value

LD R$3,$ R$1,$ #$8$ ; R$3$ holds the value of the current node

; Compare the current node's value with the target value

CMP R$2,$ R$3$

BEQ found ; If equal, value found

; If target value is less than current node's value, move to the left child

BLT move$\_$left

; If target value is greater than current node's value, move to the right child

BGT move$\_$right

not$\_$found:

; If value not found, return $0$ in R$1$

MOV R$1,$ #$0$

HALT ; End program

found:

; Value found, return the address $($R$1$ points to the node$)$

HALT ; End program

move$\_$left:

; Move to left child $($left pointer$)$

LD R$1,$ R$1,$ #$0$ ; R$1$ now points to the left child

B search$\_$loop ; Repeat the search loop

move$\_$right:

; Move to right child $($right pointer$)$; Binary Tree Search Program for VISUAL$2$

; Input:

; R$0-$ Value to search

; R$1-$ Pointer to the tree root $(0$x$200)$

; Output:

; R$1-$ Address of the value if found, $0$ if not found

start:

; Load the value to search

LD R$2,$ R$0,$ #$0$ ; R$2$ now holds the value to search

; Check if the tree root is null $($empty tree$)$

CMP R$1,$ #$0$

BEQ not$\_$found ; If root is null, go to not$\_$found

search$\_$loop:

; Load the current node's value

LD R$3,$ R$1,$ #$8$ ; R$3$ holds the value of the current node

; Compare the current node's value with the target value

CMP R$2,$ R$3$

BEQ found ; If equal, value found

; If target value is less than current node's value, move to the left child

BLT move$\_$left

; If target value is greater than current node's value, move to the right child

BGT move$\_$right

not$\_$found:

; If value not found, return $0$ in R$1$

MOV R$1,$ #$0$

HALT ; End program

found:

; Value found, return the address $($R$1$ points to the node$)$

HALT ; End program

move$\_$left:

; Move to left child $($left pointer$)$

LD R$1,$ R$1,$ #$0$ ; R$1$ now points to the left child

B search$\_$loop ; Repeat the search loop

move$\_$right:

; Move to right child $($right pointer$)$

LD R$1,$ R$1,$ #$4$ ; R$1$ now points to the right child

B search$\_$loop ; Repeat the search loop

LD R$1,$ R$1,$ #$4$ ; R$1$ now points to the right child

B search$\_$loop ; Repeat the search loop