What sequence of nodes from the tree

would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.)
def printTree(Tree):
if (Tree is not None):
Stack.push(Tree.Value)
printTree(Tree.Right)
if (not Stack.isEmpty()):
print(Stack.pop())

Question

What sequence of nodes from the tree
  
would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.)
def printTree(Tree):
if (Tree is not None):
Stack.push(Tree.Value)
printTree(Tree.Right)
if (not Stack.isEmpty()):
print(Stack.pop())

Quizplus · Accepted Answer

The Answer of What sequence of nodes from the tree
  
would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.)
def printTree(Tree):
if (Tree is not None):
Stack.push(Tree.Value)
printTree(Tree.Right)
if (not Stack.isEmpty()):
print(Stack.pop())

What Sequence of Nodes from the Tree