The following code intends to travers a linked list in search for a given value in R$0$ and returns the address

of this value into R$1($but not the address of the node$).$ If the value was not found, it returns $0$ in R$1,($i$.$e$.,$ a

null address$).$

How about traversing a binary search tree?

R$0$ maintains a value to search. R$1$ first points to the tree root and is used to access each tree node. You can

access its left pointer, right pointer, and value with

struct node $\{$

struct node $*$left; $//$ R$1$

struct node $*$right; $//$ R$1+4$

int value; $//$ R$1+8$

$\}$