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: 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)

Answer: C