TITLE	"a tree"

; build a tree in memory
; each tree node is 3 words:
;	pointer to string
;	pointer to left child
;	pointer to right child
;
; strings are NUL terminated
; null pointers are zero
NUL	=	0
null	=	0

	USE	"hawk.macs"

; the root
ROOT:	W	DAROOT

; a first node
DAROOT:	W	LEFTSON
	W	RITESON
	W	ROOTST

ROOTST:	B	'b','o','b',NUL

	ALIGN	4
LEFTSON:W	null
	W	null
	W	LEFTST

LEFTST:	ASCII	"alice",NUL
	ALIGN	4

RITESON:W	LEFTGC,RITEGC,RITEST
RITEGC:	W	null,null,RGCST
LEFTGC: W	null,null,LGCST

RITEST:	ASCII	"mary",NUL
RGCST:	ASCII	"zeyneb",NUL
LGCST:	ASCII	"fred",NUL

	END