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
Computer Science & Information Technology
You might also like to view...
An administrator receives reports from users in an office that their 802.11g wireless connectivity has been problematic since the installation of the new wireless phone system. At which of the following frequencies are both systems operating at to cause this issue?
A. 2.4GHz B. 900MHz C. 1.1GHz D. 5GHz
Computer Science & Information Technology
COGNITIVE ASSESSMENT Which of the following terms refers to someone who accesses a computer or network illegally with the intent of malicious action?
A. script kiddie B. cracker C. cyberextortionist D. cyberterrorist
Computer Science & Information Technology