Show the result of the recursive function in the algorithm below, using the given tree:

Algorithm treeTraversal (tree)
1 if tree is null
1 print “Null”
2 else
1 treeTraversal (right subtree)
2 print “right is done"
3 treeTraversal (left subtree)
4 print (tree data)
3 end if
end treeTraversal

Question

Show the result of the recursive function in the algorithm below, using the given tree:    

 Algorithm treeTraversal (tree) 
     1    if tree is null
         1    print  “Null”
     2    else
         1    treeTraversal (right subtree)
         2    print “right is done"     
         3    treeTraversal (left subtree)                                                      
         4    print (tree data)                                                                  
     3     end  if 
  end treeTraversal

anonymous · Answer

attachment

rsmith6559 · Answer

Since treeData is never assigned to, if printing it didn't cause an error, it would print nothing.  I don't see nodes E and H ever being visited.