boolean contains(TreeNode node, int target) {
while (node != null) {
if (node.value == target) return true;
node = target < node.value ? node.left : node.right;
}
return false;
}
def contains(node, target: int) -> bool:
while node:
if node.value == target:
return True
node = node.left if target < node.value else node.right
return False
def contains(node0: TreeNode, target: Int): Boolean =
var node = node0
while node != null do
if node.value == target then return true
node = if target < node.value then node.left else node.right
false
bool contains(TreeNode* node, int target) {
while (node != nullptr) {
if (node->value == target) return true;
node = target < node->value ? node->left : node->right;
}
return false;
}