From BeebWiki
Jump to: navigation, search

OSWORD &58 (88 ) - Insert node into binary tree DVR

On entry:
 XY+0..1=address of the root of the tree
 XY+2..3=address of a data comparison routine
 XY+4..5=address of the new node
 The data comparison routine is called with two addresses on
 the stack (low bytes first), and should exit with the Z
 flag set if the data at the addresses compares equal, or
 the N flag set if the first item is less than the second.
On exit:
 C is set if the node was already in the tree and was not
 inserted, in which case XY contain the address of the data
 in the tree.

See Also

Jgharston 13:53, 26 May 2009 (UTC)