How is a value searched for in a Binary Search Tree?
def search(node, target):
if node is None:
return None
elif node.data == target:
return node
elif target < node.data:
return search(node.@(4), target)
else:
return search(node.@(5), target)
def search(node, target):
if node is None:
return None
elif node.data == target:
return node
elif target < node.data:
return search(node.left, target)
else:
return search(node.right, target)