/* How about some more structure data */
a = 5
tree t=(1 (2 3))
print t
root(t)
left(t)
right(t)
while ( a <= 10 ) {
	print a
	a = a + 1
}
a++
b++
if  (isempty(t)){ a--} 


/* Did that work? */