Question

Complete the recursive search function for a Binary Search Tree (BS

T . class Node: def __init__(self, data): self.data = data self.left = None self.right = None def search(root, key): if root is None or root.data == key: return root if key < root.data: _________ # Line to complete (search left subtree) else: _________ # Line to complete (search right subtree)

A return search(root.left, key) ; return search(root.right, key)

B search(root.left, key) ; search(root.right, key)

C return root.left ; return root.right

D return search(root.right, key) ; return search(root.left, key)

E return key ; return key