The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?
def printTree (Tree):
If (Tree is not None):
PrintTree(Tree.Left)
PrintTree (Tree.Right)
Print(Tree.Value)

Question

The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? 
def printTree (Tree):
If (Tree is not None):
PrintTree(Tree.Left)
PrintTree (Tree.Right)
Print(Tree.Value)

Quizplus · Accepted Answer

In order to print the nodes in alphabetical order, we need to do an inorder traversal. And inorder traversal of the binary search tree gives the nodes in alphabetical order. The tree in option B is a binary search tree which means the inorder traversal will give the nodes in alphabetical order. Therefore, option B is the best choice.

The Nodes in Which of the Trees Below Will Be