In the Code for the Inorder Method for a Binary

question 16

Multiple Choice

In the code for the inorder method for a binary search tree, what is the missing code? def inorder(self) :
Lyst = list()
Def recurse(node) :
If node != None:
< missing code >
Lyst.append(node.data)
Recurse(node.right)
Recurse(self.root)
Return iter(lyst)

• A) recurse(node.root)
• B) return(node.data)
• C) recurse(node.left)
• D) return iter(self.root)