과제 해야 되는데

헐 뭔문제임 'ㅁ'?

show the recult of the recursive function in algorithm 6-9 using the tree in figure 6-26

algorithm tree traversal (tree)

1 if three is null

print null

2 else

treetraversal (right subtree)

print "right is done"

treetraversal (left subtree)

print (tree data)

3 end if

헐 알고리즘 수학문제인듯 ㄷㄷ